/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/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:24:08,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:24:08,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:24:08,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:24:08,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:24:08,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:24:08,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:24:08,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:24:08,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:24:08,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:24:08,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:24:08,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:24:08,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:24:08,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:24:08,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:24:08,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:24:08,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:24:08,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:24:08,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:24:08,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:24:08,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:24:08,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:24:08,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:24:08,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:24:08,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:24:08,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:24:08,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:24:08,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:24:08,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:24:08,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:24:08,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:24:08,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:24:08,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:24:08,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:24:08,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:24:08,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:24:08,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:24:08,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:24:08,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:24:08,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:24:08,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:24:08,137 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:24:08,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:24:08,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:24:08,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:24:08,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:24:08,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:24:08,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:24:08,169 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:24:08,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:24:08,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:24:08,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:24:08,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:24:08,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:24:08,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:24:08,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:24:08,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:24:08,171 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:24:08,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:24:08,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:24:08,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:24:08,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:24:08,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:24:08,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:24:08,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:24:08,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:08,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:24:08,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:24:08,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:24:08,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:24:08,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:24:08,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:24:08,174 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:24:08,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:24:08,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:24:08,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:24:08,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:24:08,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:24:08,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-12-05 20:24:09,685 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:24:10,001 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:24:10,002 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-12-05 20:24:10,012 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeeb9777/a69b924e14a44370a00c05a0da5f1514/FLAGb69859b11 [2022-12-05 20:24:10,031 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeeb9777/a69b924e14a44370a00c05a0da5f1514 [2022-12-05 20:24:10,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:24:10,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:24:10,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:10,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:24:10,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:24:10,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db25b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10, skipping insertion in model container [2022-12-05 20:24:10,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:24:10,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:24:10,219 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/mix051_tso.oepc.i[949,962] [2022-12-05 20:24:10,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:10,476 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:24:10,486 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/mix051_tso.oepc.i[949,962] [2022-12-05 20:24:10,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:10,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:10,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:10,608 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:24:10,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10 WrapperNode [2022-12-05 20:24:10,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:10,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:10,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:24:10,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:24:10,615 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:24:10" (1/1) ... [2022-12-05 20:24:10,644 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:24:10" (1/1) ... [2022-12-05 20:24:10,684 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-05 20:24:10,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:10,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:24:10,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:24:10,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:24:10,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,722 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:24:10,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:24:10,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:24:10,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:24:10,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (1/1) ... [2022-12-05 20:24:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:24:10,768 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:24:10,789 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:24:10,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:24:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:24:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:24:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:24:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:24:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:24:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:24:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:24:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:24:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:24:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:24:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:24:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:24:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:24:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:24:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:24:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:24:10,813 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:24:11,008 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:24:11,011 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:24:11,335 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:24:11,432 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:24:11,432 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:24:11,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:11 BoogieIcfgContainer [2022-12-05 20:24:11,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:24:11,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:24:11,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:24:11,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:24:11,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:24:10" (1/3) ... [2022-12-05 20:24:11,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ac2887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:11, skipping insertion in model container [2022-12-05 20:24:11,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:10" (2/3) ... [2022-12-05 20:24:11,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ac2887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:11, skipping insertion in model container [2022-12-05 20:24:11,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:11" (3/3) ... [2022-12-05 20:24:11,441 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-12-05 20:24:11,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:24:11,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:24:11,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:24:11,505 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:24:11,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:24:11,636 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:24:11,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:11,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:24:11,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:24:11,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-05 20:24:11,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:24:11,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:24:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-05 20:24:11,729 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:24:11,729 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:11,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:24:11,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:24:11,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 3044 [2022-12-05 20:24:17,534 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-05 20:24:17,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:24:17,550 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;@29778bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:24:17,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:24:17,553 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:24:17,553 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:17,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:17,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:24:17,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash 515982542, now seen corresponding path program 1 times [2022-12-05 20:24:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:17,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287155680] [2022-12-05 20:24:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:17,874 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:24:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:17,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287155680] [2022-12-05 20:24:17,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287155680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:17,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:17,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:24:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592505759] [2022-12-05 20:24:17,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:17,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:17,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 20:24:17,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:24:17,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:17,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 20:24:17,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:18,885 INFO L130 PetriNetUnfolder]: 4863/6806 cut-off events. [2022-12-05 20:24:18,885 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-05 20:24:18,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13630 conditions, 6806 events. 4863/6806 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34589 event pairs, 1800 based on Foata normal form. 0/6185 useless extension candidates. Maximal degree in co-relation 13618. Up to 5308 conditions per place. [2022-12-05 20:24:18,926 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 37 selfloop transitions, 2 changer transitions 8/51 dead transitions. [2022-12-05 20:24:18,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 214 flow [2022-12-05 20:24:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-05 20:24:18,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-05 20:24:18,937 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 64 transitions. [2022-12-05 20:24:18,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 214 flow [2022-12-05 20:24:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:18,944 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 66 flow [2022-12-05 20:24:18,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-05 20:24:18,948 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2022-12-05 20:24:18,948 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 66 flow [2022-12-05 20:24:18,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:24:18,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:18,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:18,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:24:18,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash -504039928, now seen corresponding path program 1 times [2022-12-05 20:24:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:18,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109362098] [2022-12-05 20:24:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:19,725 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:24:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:19,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109362098] [2022-12-05 20:24:19,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109362098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:19,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:19,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90075658] [2022-12-05 20:24:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:19,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:19,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 20:24:19,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 66 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:24:19,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:19,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 20:24:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:20,891 INFO L130 PetriNetUnfolder]: 8115/10949 cut-off events. [2022-12-05 20:24:20,892 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2022-12-05 20:24:20,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22789 conditions, 10949 events. 8115/10949 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50045 event pairs, 2102 based on Foata normal form. 81/11030 useless extension candidates. Maximal degree in co-relation 22779. Up to 10046 conditions per place. [2022-12-05 20:24:20,950 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 51 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2022-12-05 20:24:20,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 284 flow [2022-12-05 20:24:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-05 20:24:20,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-05 20:24:20,953 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 66 flow. Second operand 4 states and 66 transitions. [2022-12-05 20:24:20,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 284 flow [2022-12-05 20:24:20,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:20,955 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 148 flow [2022-12-05 20:24:20,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-12-05 20:24:20,956 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2022-12-05 20:24:20,956 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 148 flow [2022-12-05 20:24:20,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:24:20,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:20,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:20,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:24:20,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1733509933, now seen corresponding path program 1 times [2022-12-05 20:24:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:20,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25084087] [2022-12-05 20:24:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:21,359 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:24:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25084087] [2022-12-05 20:24:21,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25084087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:21,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:21,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81136425] [2022-12-05 20:24:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:21,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:21,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-05 20:24:21,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:24:21,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:21,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-05 20:24:21,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:22,530 INFO L130 PetriNetUnfolder]: 6771/9406 cut-off events. [2022-12-05 20:24:22,531 INFO L131 PetriNetUnfolder]: For 4758/4988 co-relation queries the response was YES. [2022-12-05 20:24:22,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24427 conditions, 9406 events. 6771/9406 cut-off events. For 4758/4988 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 49105 event pairs, 1791 based on Foata normal form. 142/9183 useless extension candidates. Maximal degree in co-relation 24415. Up to 7240 conditions per place. [2022-12-05 20:24:22,590 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 59 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2022-12-05 20:24:22,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 78 transitions, 420 flow [2022-12-05 20:24:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-05 20:24:22,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-05 20:24:22,594 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 148 flow. Second operand 4 states and 70 transitions. [2022-12-05 20:24:22,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 78 transitions, 420 flow [2022-12-05 20:24:22,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:24:22,599 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 269 flow [2022-12-05 20:24:22,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-12-05 20:24:22,600 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-05 20:24:22,601 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 269 flow [2022-12-05 20:24:22,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:24:22,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:22,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:22,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:24:22,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2095768286, now seen corresponding path program 1 times [2022-12-05 20:24:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:22,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939431246] [2022-12-05 20:24:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:22,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:23,166 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:24:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939431246] [2022-12-05 20:24:23,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939431246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:23,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:23,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737204905] [2022-12-05 20:24:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:23,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:23,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:23,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:23,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-05 20:24:23,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:24:23,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:23,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-05 20:24:23,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:24,415 INFO L130 PetriNetUnfolder]: 8140/11451 cut-off events. [2022-12-05 20:24:24,415 INFO L131 PetriNetUnfolder]: For 15669/16026 co-relation queries the response was YES. [2022-12-05 20:24:24,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35588 conditions, 11451 events. 8140/11451 cut-off events. For 15669/16026 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 63011 event pairs, 1822 based on Foata normal form. 440/11467 useless extension candidates. Maximal degree in co-relation 35572. Up to 7649 conditions per place. [2022-12-05 20:24:24,481 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 73 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2022-12-05 20:24:24,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 691 flow [2022-12-05 20:24:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-05 20:24:24,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5235294117647059 [2022-12-05 20:24:24,486 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 269 flow. Second operand 5 states and 89 transitions. [2022-12-05 20:24:24,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 691 flow [2022-12-05 20:24:24,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 107 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:24,498 INFO L231 Difference]: Finished difference. Result has 51 places, 66 transitions, 474 flow [2022-12-05 20:24:24,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=51, PETRI_TRANSITIONS=66} [2022-12-05 20:24:24,499 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2022-12-05 20:24:24,500 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 66 transitions, 474 flow [2022-12-05 20:24:24,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:24:24,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:24,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:24,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:24:24,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2095777586, now seen corresponding path program 2 times [2022-12-05 20:24:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:24,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390661414] [2022-12-05 20:24:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:24,950 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:24:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390661414] [2022-12-05 20:24:24,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390661414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:24,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:24,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527108161] [2022-12-05 20:24:24,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:24,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:24,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-05 20:24:24,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 66 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:24:24,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:24,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-05 20:24:24,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:26,192 INFO L130 PetriNetUnfolder]: 8635/12162 cut-off events. [2022-12-05 20:24:26,192 INFO L131 PetriNetUnfolder]: For 30953/32073 co-relation queries the response was YES. [2022-12-05 20:24:26,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46582 conditions, 12162 events. 8635/12162 cut-off events. For 30953/32073 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 67423 event pairs, 1622 based on Foata normal form. 530/12242 useless extension candidates. Maximal degree in co-relation 46563. Up to 9136 conditions per place. [2022-12-05 20:24:26,273 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 101 selfloop transitions, 39 changer transitions 0/146 dead transitions. [2022-12-05 20:24:26,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 146 transitions, 1146 flow [2022-12-05 20:24:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-05 20:24:26,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4742647058823529 [2022-12-05 20:24:26,275 INFO L175 Difference]: Start difference. First operand has 51 places, 66 transitions, 474 flow. Second operand 8 states and 129 transitions. [2022-12-05 20:24:26,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 146 transitions, 1146 flow [2022-12-05 20:24:26,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 146 transitions, 1091 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:26,305 INFO L231 Difference]: Finished difference. Result has 60 places, 91 transitions, 787 flow [2022-12-05 20:24:26,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=787, PETRI_PLACES=60, PETRI_TRANSITIONS=91} [2022-12-05 20:24:26,306 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-05 20:24:26,306 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 91 transitions, 787 flow [2022-12-05 20:24:26,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:24:26,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:26,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:26,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:24:26,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2093932466, now seen corresponding path program 3 times [2022-12-05 20:24:26,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:26,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807876379] [2022-12-05 20:24:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:26,812 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:24:26,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:26,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807876379] [2022-12-05 20:24:26,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807876379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:26,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:26,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073340538] [2022-12-05 20:24:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:26,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:26,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:26,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-05 20:24:26,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 91 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:24:26,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:26,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-05 20:24:26,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:28,234 INFO L130 PetriNetUnfolder]: 9774/13760 cut-off events. [2022-12-05 20:24:28,234 INFO L131 PetriNetUnfolder]: For 55048/56448 co-relation queries the response was YES. [2022-12-05 20:24:28,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56060 conditions, 13760 events. 9774/13760 cut-off events. For 55048/56448 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 78301 event pairs, 2276 based on Foata normal form. 1032/14230 useless extension candidates. Maximal degree in co-relation 56037. Up to 8037 conditions per place. [2022-12-05 20:24:28,338 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 77 selfloop transitions, 41 changer transitions 0/124 dead transitions. [2022-12-05 20:24:28,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 1179 flow [2022-12-05 20:24:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-05 20:24:28,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2022-12-05 20:24:28,340 INFO L175 Difference]: Start difference. First operand has 60 places, 91 transitions, 787 flow. Second operand 5 states and 74 transitions. [2022-12-05 20:24:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 1179 flow [2022-12-05 20:24:28,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 124 transitions, 1096 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:28,426 INFO L231 Difference]: Finished difference. Result has 63 places, 96 transitions, 922 flow [2022-12-05 20:24:28,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=922, PETRI_PLACES=63, PETRI_TRANSITIONS=96} [2022-12-05 20:24:28,429 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-05 20:24:28,429 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 96 transitions, 922 flow [2022-12-05 20:24:28,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:24:28,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:28,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:28,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:24:28,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash -649235226, now seen corresponding path program 1 times [2022-12-05 20:24:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:28,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712843944] [2022-12-05 20:24:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:28,561 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:24:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:28,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712843944] [2022-12-05 20:24:28,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712843944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:28,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:28,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865634024] [2022-12-05 20:24:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:28,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:28,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:28,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:28,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 20:24:28,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:24:28,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:28,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 20:24:28,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:29,333 INFO L130 PetriNetUnfolder]: 5563/8056 cut-off events. [2022-12-05 20:24:29,333 INFO L131 PetriNetUnfolder]: For 55470/56115 co-relation queries the response was YES. [2022-12-05 20:24:29,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37242 conditions, 8056 events. 5563/8056 cut-off events. For 55470/56115 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 44991 event pairs, 1374 based on Foata normal form. 496/8106 useless extension candidates. Maximal degree in co-relation 37217. Up to 6056 conditions per place. [2022-12-05 20:24:29,389 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 99 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2022-12-05 20:24:29,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 1248 flow [2022-12-05 20:24:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 20:24:29,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-05 20:24:29,390 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 922 flow. Second operand 3 states and 54 transitions. [2022-12-05 20:24:29,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 1248 flow [2022-12-05 20:24:29,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 1194 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:29,478 INFO L231 Difference]: Finished difference. Result has 63 places, 85 transitions, 743 flow [2022-12-05 20:24:29,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=63, PETRI_TRANSITIONS=85} [2022-12-05 20:24:29,479 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-05 20:24:29,479 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 85 transitions, 743 flow [2022-12-05 20:24:29,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:24:29,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:29,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:29,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:24:29,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1937846464, now seen corresponding path program 1 times [2022-12-05 20:24:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:29,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155403443] [2022-12-05 20:24:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:29,602 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:24:29,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:29,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155403443] [2022-12-05 20:24:29,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155403443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:29,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:29,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937686387] [2022-12-05 20:24:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:29,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:29,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:29,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 20:24:29,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 85 transitions, 743 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:24:29,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:29,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 20:24:29,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:30,059 INFO L130 PetriNetUnfolder]: 2925/4424 cut-off events. [2022-12-05 20:24:30,059 INFO L131 PetriNetUnfolder]: For 24321/24725 co-relation queries the response was YES. [2022-12-05 20:24:30,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20679 conditions, 4424 events. 2925/4424 cut-off events. For 24321/24725 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 23911 event pairs, 615 based on Foata normal form. 436/4631 useless extension candidates. Maximal degree in co-relation 20654. Up to 1830 conditions per place. [2022-12-05 20:24:30,087 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 119 selfloop transitions, 9 changer transitions 0/139 dead transitions. [2022-12-05 20:24:30,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 139 transitions, 1469 flow [2022-12-05 20:24:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-05 20:24:30,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2022-12-05 20:24:30,088 INFO L175 Difference]: Start difference. First operand has 63 places, 85 transitions, 743 flow. Second operand 4 states and 74 transitions. [2022-12-05 20:24:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 139 transitions, 1469 flow [2022-12-05 20:24:30,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 139 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:30,121 INFO L231 Difference]: Finished difference. Result has 66 places, 85 transitions, 756 flow [2022-12-05 20:24:30,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=756, PETRI_PLACES=66, PETRI_TRANSITIONS=85} [2022-12-05 20:24:30,122 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2022-12-05 20:24:30,122 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 85 transitions, 756 flow [2022-12-05 20:24:30,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:24:30,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:30,122 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:24:30,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:24:30,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1506144184, now seen corresponding path program 1 times [2022-12-05 20:24:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:30,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434537184] [2022-12-05 20:24:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:30,335 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:24:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:30,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434537184] [2022-12-05 20:24:30,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434537184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:30,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:30,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340231439] [2022-12-05 20:24:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:30,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:30,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:30,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 20:24:30,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 85 transitions, 756 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:24:30,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:30,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 20:24:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:30,812 INFO L130 PetriNetUnfolder]: 2271/3409 cut-off events. [2022-12-05 20:24:30,813 INFO L131 PetriNetUnfolder]: For 21486/21837 co-relation queries the response was YES. [2022-12-05 20:24:30,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16648 conditions, 3409 events. 2271/3409 cut-off events. For 21486/21837 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17968 event pairs, 458 based on Foata normal form. 240/3457 useless extension candidates. Maximal degree in co-relation 16621. Up to 1334 conditions per place. [2022-12-05 20:24:30,841 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 126 selfloop transitions, 13 changer transitions 0/150 dead transitions. [2022-12-05 20:24:30,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 150 transitions, 1594 flow [2022-12-05 20:24:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-05 20:24:30,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2022-12-05 20:24:30,842 INFO L175 Difference]: Start difference. First operand has 66 places, 85 transitions, 756 flow. Second operand 5 states and 92 transitions. [2022-12-05 20:24:30,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 150 transitions, 1594 flow [2022-12-05 20:24:30,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 150 transitions, 1465 flow, removed 30 selfloop flow, removed 6 redundant places. [2022-12-05 20:24:30,870 INFO L231 Difference]: Finished difference. Result has 64 places, 83 transitions, 697 flow [2022-12-05 20:24:30,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=697, PETRI_PLACES=64, PETRI_TRANSITIONS=83} [2022-12-05 20:24:30,871 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2022-12-05 20:24:30,871 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 83 transitions, 697 flow [2022-12-05 20:24:30,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:24:30,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:30,872 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] [2022-12-05 20:24:30,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:24:30,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash 969807144, now seen corresponding path program 1 times [2022-12-05 20:24:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:30,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365370634] [2022-12-05 20:24:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:31,190 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:24:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:31,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365370634] [2022-12-05 20:24:31,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365370634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:31,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:31,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188448611] [2022-12-05 20:24:31,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:31,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:31,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:31,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 20:24:31,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 83 transitions, 697 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:24:31,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:31,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 20:24:31,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:31,869 INFO L130 PetriNetUnfolder]: 4551/6651 cut-off events. [2022-12-05 20:24:31,869 INFO L131 PetriNetUnfolder]: For 25489/25489 co-relation queries the response was YES. [2022-12-05 20:24:31,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30087 conditions, 6651 events. 4551/6651 cut-off events. For 25489/25489 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34166 event pairs, 300 based on Foata normal form. 14/6665 useless extension candidates. Maximal degree in co-relation 30062. Up to 3380 conditions per place. [2022-12-05 20:24:31,902 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 148 selfloop transitions, 16 changer transitions 53/217 dead transitions. [2022-12-05 20:24:31,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 217 transitions, 2211 flow [2022-12-05 20:24:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-05 20:24:31,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-05 20:24:31,904 INFO L175 Difference]: Start difference. First operand has 64 places, 83 transitions, 697 flow. Second operand 6 states and 84 transitions. [2022-12-05 20:24:31,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 217 transitions, 2211 flow [2022-12-05 20:24:32,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 217 transitions, 2121 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:32,006 INFO L231 Difference]: Finished difference. Result has 70 places, 96 transitions, 829 flow [2022-12-05 20:24:32,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=70, PETRI_TRANSITIONS=96} [2022-12-05 20:24:32,006 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2022-12-05 20:24:32,007 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 96 transitions, 829 flow [2022-12-05 20:24:32,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:24:32,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:32,007 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] [2022-12-05 20:24:32,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:24:32,007 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash -598873484, now seen corresponding path program 2 times [2022-12-05 20:24:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:32,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639327794] [2022-12-05 20:24:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:32,210 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:24:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:32,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639327794] [2022-12-05 20:24:32,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639327794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:32,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:32,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120125232] [2022-12-05 20:24:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:32,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:32,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 20:24:32,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 96 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:24:32,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:32,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 20:24:32,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:32,794 INFO L130 PetriNetUnfolder]: 3233/4809 cut-off events. [2022-12-05 20:24:32,794 INFO L131 PetriNetUnfolder]: For 26282/26951 co-relation queries the response was YES. [2022-12-05 20:24:32,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23004 conditions, 4809 events. 3233/4809 cut-off events. For 26282/26951 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 26758 event pairs, 492 based on Foata normal form. 202/4712 useless extension candidates. Maximal degree in co-relation 22975. Up to 1993 conditions per place. [2022-12-05 20:24:32,818 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 106 selfloop transitions, 17 changer transitions 26/162 dead transitions. [2022-12-05 20:24:32,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 162 transitions, 1650 flow [2022-12-05 20:24:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-05 20:24:32,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-05 20:24:32,820 INFO L175 Difference]: Start difference. First operand has 70 places, 96 transitions, 829 flow. Second operand 6 states and 96 transitions. [2022-12-05 20:24:32,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 162 transitions, 1650 flow [2022-12-05 20:24:32,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 162 transitions, 1612 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-12-05 20:24:32,911 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 713 flow [2022-12-05 20:24:32,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2022-12-05 20:24:32,912 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2022-12-05 20:24:32,912 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 713 flow [2022-12-05 20:24:32,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:24:32,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:32,913 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] [2022-12-05 20:24:32,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:24:32,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2103815687, now seen corresponding path program 1 times [2022-12-05 20:24:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:32,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476651504] [2022-12-05 20:24:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:32,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:33,457 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:24:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476651504] [2022-12-05 20:24:33,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476651504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:33,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:33,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:24:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028269210] [2022-12-05 20:24:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:33,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:24:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:24:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:24:33,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 20:24:33,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 713 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:24:33,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:33,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 20:24:33,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:34,437 INFO L130 PetriNetUnfolder]: 3447/5214 cut-off events. [2022-12-05 20:24:34,437 INFO L131 PetriNetUnfolder]: For 22435/22435 co-relation queries the response was YES. [2022-12-05 20:24:34,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25487 conditions, 5214 events. 3447/5214 cut-off events. For 22435/22435 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 27380 event pairs, 384 based on Foata normal form. 1/5215 useless extension candidates. Maximal degree in co-relation 25463. Up to 2944 conditions per place. [2022-12-05 20:24:34,460 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 100 selfloop transitions, 16 changer transitions 159/275 dead transitions. [2022-12-05 20:24:34,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 275 transitions, 2740 flow [2022-12-05 20:24:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 20:24:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 20:24:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-12-05 20:24:34,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-05 20:24:34,462 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 713 flow. Second operand 12 states and 141 transitions. [2022-12-05 20:24:34,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 275 transitions, 2740 flow [2022-12-05 20:24:34,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 275 transitions, 2503 flow, removed 51 selfloop flow, removed 5 redundant places. [2022-12-05 20:24:34,552 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 701 flow [2022-12-05 20:24:34,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=701, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2022-12-05 20:24:34,553 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2022-12-05 20:24:34,553 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 701 flow [2022-12-05 20:24:34,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:24:34,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:34,554 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] [2022-12-05 20:24:34,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:24:34,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -968858947, now seen corresponding path program 2 times [2022-12-05 20:24:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:34,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980444788] [2022-12-05 20:24:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:34,951 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:24:34,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980444788] [2022-12-05 20:24:34,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980444788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:34,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:34,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166571326] [2022-12-05 20:24:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:34,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:34,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:34,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 20:24:34,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 701 flow. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:24:34,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:34,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 20:24:34,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:35,622 INFO L130 PetriNetUnfolder]: 2511/3898 cut-off events. [2022-12-05 20:24:35,622 INFO L131 PetriNetUnfolder]: For 16320/16320 co-relation queries the response was YES. [2022-12-05 20:24:35,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18254 conditions, 3898 events. 2511/3898 cut-off events. For 16320/16320 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20376 event pairs, 475 based on Foata normal form. 1/3899 useless extension candidates. Maximal degree in co-relation 18225. Up to 1598 conditions per place. [2022-12-05 20:24:35,644 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 60 selfloop transitions, 3 changer transitions 116/179 dead transitions. [2022-12-05 20:24:35,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 179 transitions, 1935 flow [2022-12-05 20:24:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-05 20:24:35,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29901960784313725 [2022-12-05 20:24:35,646 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 701 flow. Second operand 6 states and 61 transitions. [2022-12-05 20:24:35,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 179 transitions, 1935 flow [2022-12-05 20:24:35,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 179 transitions, 1871 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-05 20:24:35,710 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 367 flow [2022-12-05 20:24:35,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=83, PETRI_TRANSITIONS=51} [2022-12-05 20:24:35,712 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places. [2022-12-05 20:24:35,712 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 367 flow [2022-12-05 20:24:35,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:24:35,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:35,712 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] [2022-12-05 20:24:35,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:24:35,713 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -747256521, now seen corresponding path program 3 times [2022-12-05 20:24:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:35,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944145885] [2022-12-05 20:24:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:36,935 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:24:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:36,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944145885] [2022-12-05 20:24:36,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944145885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:36,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:36,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:24:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465817868] [2022-12-05 20:24:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:36,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:24:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:24:36,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:24:36,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-05 20:24:36,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 51 transitions, 367 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 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:24:36,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:36,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-05 20:24:36,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:37,418 INFO L130 PetriNetUnfolder]: 1631/2621 cut-off events. [2022-12-05 20:24:37,418 INFO L131 PetriNetUnfolder]: For 7596/7657 co-relation queries the response was YES. [2022-12-05 20:24:37,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11244 conditions, 2621 events. 1631/2621 cut-off events. For 7596/7657 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13807 event pairs, 314 based on Foata normal form. 26/2574 useless extension candidates. Maximal degree in co-relation 11216. Up to 1073 conditions per place. [2022-12-05 20:24:37,429 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 58 selfloop transitions, 5 changer transitions 39/105 dead transitions. [2022-12-05 20:24:37,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 878 flow [2022-12-05 20:24:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-05 20:24:37,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2022-12-05 20:24:37,431 INFO L175 Difference]: Start difference. First operand has 83 places, 51 transitions, 367 flow. Second operand 6 states and 76 transitions. [2022-12-05 20:24:37,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 878 flow [2022-12-05 20:24:37,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 813 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-12-05 20:24:37,477 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 326 flow [2022-12-05 20:24:37,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2022-12-05 20:24:37,477 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2022-12-05 20:24:37,477 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 326 flow [2022-12-05 20:24:37,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 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:24:37,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:37,478 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] [2022-12-05 20:24:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:24:37,478 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1138821453, now seen corresponding path program 4 times [2022-12-05 20:24:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987527464] [2022-12-05 20:24:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:37,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:24:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:37,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:24:37,605 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:24:37,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:24:37,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:24:37,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:24:37,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:24:37,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:24:37,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:24:37,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:24:37,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:24:37,613 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:37,619 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:24:37,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:24:37,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:24:37 BasicIcfg [2022-12-05 20:24:37,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:24:37,703 INFO L158 Benchmark]: Toolchain (without parser) took 27669.28ms. Allocated memory was 170.9MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 144.6MB in the beginning and 987.9MB in the end (delta: -843.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-05 20:24:37,704 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 170.9MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:24:37,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.43ms. Allocated memory is still 170.9MB. Free memory was 144.6MB in the beginning and 116.8MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.72ms. Allocated memory is still 170.9MB. Free memory was 116.8MB in the beginning and 113.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,704 INFO L158 Benchmark]: Boogie Preprocessor took 40.53ms. Allocated memory is still 170.9MB. Free memory was 113.7MB in the beginning and 112.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,704 INFO L158 Benchmark]: RCFGBuilder took 694.90ms. Allocated memory is still 170.9MB. Free memory was 112.1MB in the beginning and 73.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,705 INFO L158 Benchmark]: TraceAbstraction took 26266.97ms. Allocated memory was 170.9MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 73.3MB in the beginning and 987.9MB in the end (delta: -914.6MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-05 20:24:37,706 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.15ms. Allocated memory is still 170.9MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 573.43ms. Allocated memory is still 170.9MB. Free memory was 144.6MB in the beginning and 116.8MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.72ms. Allocated memory is still 170.9MB. Free memory was 116.8MB in the beginning and 113.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.53ms. Allocated memory is still 170.9MB. Free memory was 113.7MB in the beginning and 112.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 694.90ms. Allocated memory is still 170.9MB. Free memory was 112.1MB in the beginning and 73.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 26266.97ms. Allocated memory was 170.9MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 73.3MB in the beginning and 987.9MB in the end (delta: -914.6MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 136 PlacesBefore, 46 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 2075, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1810, independent: 1757, independent conditional: 0, independent unconditional: 1757, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1810, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 288, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2147, independent: 318, independent conditional: 0, independent unconditional: 318, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1810, unknown conditional: 0, unknown unconditional: 1810] , Statistics on independence cache: Total cache size (in pairs): 2829, Positive cache size: 2776, Positive conditional cache size: 0, Positive unconditional cache size: 2776, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-2, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=1, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 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: 26.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 721 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1802 IncrementalHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 40 mSDtfsCounter, 1802 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=6, InterpolantAutomatonStates: 77, 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, 5.6s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 2296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:24:37,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...