/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:39:49,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:39:49,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:39:49,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:39:49,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:39:49,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:39:49,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:39:49,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:39:49,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:39:49,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:39:49,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:39:49,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:39:49,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:39:49,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:39:49,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:39:49,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:39:49,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:39:49,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:39:49,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:39:49,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:39:49,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:39:49,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:39:49,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:39:49,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:39:49,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:39:49,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:39:49,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:39:49,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:39:49,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:39:49,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:39:49,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:39:49,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:39:49,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:39:49,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:39:49,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:39:49,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:39:49,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:39:49,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:39:49,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:39:49,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:39:49,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:39:49,132 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-NoLbe.epf [2022-12-11 23:39:49,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:39:49,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:39:49,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:39:49,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:39:49,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:39:49,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:39:49,159 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:39:49,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:39:49,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:39:49,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:39:49,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:39:49,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:39:49,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:39:49,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:39:49,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:39:49,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:39:49,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:39:49,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:39:49,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:39:49,451 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:39:49,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-12-11 23:39:50,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:39:50,717 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:39:50,717 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-12-11 23:39:50,749 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84fd970ae/ef7600cc8d8a4483a2a965a1ff784e9e/FLAG3bed0e777 [2022-12-11 23:39:50,762 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84fd970ae/ef7600cc8d8a4483a2a965a1ff784e9e [2022-12-11 23:39:50,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:39:50,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:39:50,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:39:50,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:39:50,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:39:50,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:39:50" (1/1) ... [2022-12-11 23:39:50,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f111a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:50, skipping insertion in model container [2022-12-11 23:39:50,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:39:50" (1/1) ... [2022-12-11 23:39:50,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:39:50,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:39:50,928 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/mix053_tso.oepc.i[949,962] [2022-12-11 23:39:51,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:39:51,120 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:39:51,129 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/mix053_tso.oepc.i[949,962] [2022-12-11 23:39:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:51,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:51,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:39:51,189 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:39:51,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51 WrapperNode [2022-12-11 23:39:51,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:39:51,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:39:51,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:39:51,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:39:51,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,254 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-11 23:39:51,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:39:51,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:39:51,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:39:51,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:39:51,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:39:51,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:39:51,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:39:51,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:39:51,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (1/1) ... [2022-12-11 23:39:51,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:39:51,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:39:51,328 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-11 23:39:51,369 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-11 23:39:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:39:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:39:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:39:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:39:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:39:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:39:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:39:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:39:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:39:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:39:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:39:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 23:39:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 23:39:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:39:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:39:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:39:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:39:51,399 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:39:51,581 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:39:51,582 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:39:51,785 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:39:51,879 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:39:51,880 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:39:51,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:39:51 BoogieIcfgContainer [2022-12-11 23:39:51,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:39:51,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:39:51,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:39:51,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:39:51,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:39:50" (1/3) ... [2022-12-11 23:39:51,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4439585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:39:51, skipping insertion in model container [2022-12-11 23:39:51,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:51" (2/3) ... [2022-12-11 23:39:51,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4439585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:39:51, skipping insertion in model container [2022-12-11 23:39:51,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:39:51" (3/3) ... [2022-12-11 23:39:51,889 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-12-11 23:39:51,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:39:51,902 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:39:51,902 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:39:51,957 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:39:51,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-11 23:39:52,058 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-11 23:39:52,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:39:52,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-11 23:39:52,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-11 23:39:52,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-11 23:39:52,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:39:52,083 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;@26d8004b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:39:52,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 23:39:52,096 INFO L130 PetriNetUnfolder]: 0/72 cut-off events. [2022-12-11 23:39:52,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:39:52,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:52,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:39:52,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 812814444, now seen corresponding path program 1 times [2022-12-11 23:39:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221644879] [2022-12-11 23:39:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:52,591 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-11 23:39:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:52,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221644879] [2022-12-11 23:39:52,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221644879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:52,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:52,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:39:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952827872] [2022-12-11 23:39:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:52,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:39:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:39:52,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:39:52,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 127 [2022-12-11 23:39:52,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-11 23:39:52,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:52,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 127 [2022-12-11 23:39:52,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:52,790 INFO L130 PetriNetUnfolder]: 57/458 cut-off events. [2022-12-11 23:39:52,791 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 23:39:52,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 458 events. 57/458 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2299 event pairs, 29 based on Foata normal form. 19/452 useless extension candidates. Maximal degree in co-relation 534. Up to 75 conditions per place. [2022-12-11 23:39:52,800 INFO L137 encePairwiseOnDemand]: 122/127 looper letters, 14 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2022-12-11 23:39:52,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 295 flow [2022-12-11 23:39:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:39:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:39:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2022-12-11 23:39:52,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.937007874015748 [2022-12-11 23:39:52,817 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 0 predicate places. [2022-12-11 23:39:52,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 124 transitions, 295 flow [2022-12-11 23:39:52,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 124 transitions, 295 flow [2022-12-11 23:39:52,822 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 295 flow [2022-12-11 23:39:52,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-11 23:39:52,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:52,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:39:52,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:39:52,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash 841384468, now seen corresponding path program 1 times [2022-12-11 23:39:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:52,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168776578] [2022-12-11 23:39:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:53,710 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-11 23:39:53,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:53,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168776578] [2022-12-11 23:39:53,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168776578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:53,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:53,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:39:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799309266] [2022-12-11 23:39:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:53,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:39:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:39:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:39:53,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 127 [2022-12-11 23:39:53,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 295 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 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-11 23:39:53,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:53,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 127 [2022-12-11 23:39:53,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:55,271 INFO L130 PetriNetUnfolder]: 4079/9801 cut-off events. [2022-12-11 23:39:55,271 INFO L131 PetriNetUnfolder]: For 1957/3052 co-relation queries the response was YES. [2022-12-11 23:39:55,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18091 conditions, 9801 events. 4079/9801 cut-off events. For 1957/3052 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 93963 event pairs, 278 based on Foata normal form. 0/9602 useless extension candidates. Maximal degree in co-relation 18025. Up to 2757 conditions per place. [2022-12-11 23:39:55,326 INFO L137 encePairwiseOnDemand]: 113/127 looper letters, 53 selfloop transitions, 15 changer transitions 116/261 dead transitions. [2022-12-11 23:39:55,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 261 transitions, 1082 flow [2022-12-11 23:39:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:39:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:39:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1343 transitions. [2022-12-11 23:39:55,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8134463961235615 [2022-12-11 23:39:55,331 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 12 predicate places. [2022-12-11 23:39:55,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 261 transitions, 1082 flow [2022-12-11 23:39:55,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 145 transitions, 536 flow [2022-12-11 23:39:55,353 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 145 transitions, 536 flow [2022-12-11 23:39:55,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 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-11 23:39:55,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:55,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:39:55,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:39:55,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2086661141, now seen corresponding path program 1 times [2022-12-11 23:39:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:55,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941267511] [2022-12-11 23:39:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:56,152 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-11 23:39:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941267511] [2022-12-11 23:39:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941267511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:56,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:56,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:39:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423978225] [2022-12-11 23:39:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:56,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:39:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:56,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:39:56,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:39:56,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 127 [2022-12-11 23:39:56,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 145 transitions, 536 flow. Second operand has 10 states, 10 states have (on average 94.2) internal successors, (942), 10 states have internal predecessors, (942), 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-11 23:39:56,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:56,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 127 [2022-12-11 23:39:56,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:57,768 INFO L130 PetriNetUnfolder]: 3221/6897 cut-off events. [2022-12-11 23:39:57,768 INFO L131 PetriNetUnfolder]: For 2058/6639 co-relation queries the response was YES. [2022-12-11 23:39:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18375 conditions, 6897 events. 3221/6897 cut-off events. For 2058/6639 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 57790 event pairs, 387 based on Foata normal form. 214/6957 useless extension candidates. Maximal degree in co-relation 18296. Up to 3760 conditions per place. [2022-12-11 23:39:57,805 INFO L137 encePairwiseOnDemand]: 106/127 looper letters, 75 selfloop transitions, 47 changer transitions 164/363 dead transitions. [2022-12-11 23:39:57,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 363 transitions, 2207 flow [2022-12-11 23:39:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-11 23:39:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-11 23:39:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2408 transitions. [2022-12-11 23:39:57,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7900262467191601 [2022-12-11 23:39:57,811 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 14 predicate places. [2022-12-11 23:39:57,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 363 transitions, 2207 flow [2022-12-11 23:39:57,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 199 transitions, 1081 flow [2022-12-11 23:39:57,834 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 199 transitions, 1081 flow [2022-12-11 23:39:57,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.2) internal successors, (942), 10 states have internal predecessors, (942), 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-11 23:39:57,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:57,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:39:57,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:39:57,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1434661817, now seen corresponding path program 1 times [2022-12-11 23:39:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:57,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346150370] [2022-12-11 23:39:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:58,292 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-11 23:39:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346150370] [2022-12-11 23:39:58,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346150370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:58,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:58,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:39:58,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93406503] [2022-12-11 23:39:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:58,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:39:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:58,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:39:58,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:39:58,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2022-12-11 23:39:58,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 199 transitions, 1081 flow. Second operand has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 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-11 23:39:58,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:58,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2022-12-11 23:39:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:59,325 INFO L130 PetriNetUnfolder]: 2894/6523 cut-off events. [2022-12-11 23:39:59,325 INFO L131 PetriNetUnfolder]: For 4797/9393 co-relation queries the response was YES. [2022-12-11 23:39:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20090 conditions, 6523 events. 2894/6523 cut-off events. For 4797/9393 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 56070 event pairs, 378 based on Foata normal form. 211/6578 useless extension candidates. Maximal degree in co-relation 20004. Up to 3427 conditions per place. [2022-12-11 23:39:59,359 INFO L137 encePairwiseOnDemand]: 115/127 looper letters, 91 selfloop transitions, 29 changer transitions 98/333 dead transitions. [2022-12-11 23:39:59,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 333 transitions, 2521 flow [2022-12-11 23:39:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:39:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:39:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2037 transitions. [2022-12-11 23:39:59,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8441773725652715 [2022-12-11 23:39:59,364 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 17 predicate places. [2022-12-11 23:39:59,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 333 transitions, 2521 flow [2022-12-11 23:39:59,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 235 transitions, 1589 flow [2022-12-11 23:39:59,387 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 235 transitions, 1589 flow [2022-12-11 23:39:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 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-11 23:39:59,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:59,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:39:59,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:39:59,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -110977454, now seen corresponding path program 1 times [2022-12-11 23:39:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:59,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210601004] [2022-12-11 23:39:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:00,169 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-11 23:40:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:00,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210601004] [2022-12-11 23:40:00,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210601004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:00,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:00,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929696254] [2022-12-11 23:40:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:00,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:00,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 127 [2022-12-11 23:40:00,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 235 transitions, 1589 flow. Second operand has 12 states, 12 states have (on average 92.16666666666667) internal successors, (1106), 12 states have internal predecessors, (1106), 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-11 23:40:00,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:00,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 127 [2022-12-11 23:40:00,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:01,900 INFO L130 PetriNetUnfolder]: 2635/5982 cut-off events. [2022-12-11 23:40:01,900 INFO L131 PetriNetUnfolder]: For 5466/12822 co-relation queries the response was YES. [2022-12-11 23:40:01,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22630 conditions, 5982 events. 2635/5982 cut-off events. For 5466/12822 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 50076 event pairs, 268 based on Foata normal form. 286/6109 useless extension candidates. Maximal degree in co-relation 22529. Up to 3230 conditions per place. [2022-12-11 23:40:01,939 INFO L137 encePairwiseOnDemand]: 108/127 looper letters, 138 selfloop transitions, 67 changer transitions 102/382 dead transitions. [2022-12-11 23:40:01,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 382 transitions, 3446 flow [2022-12-11 23:40:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-11 23:40:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-11 23:40:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2137 transitions. [2022-12-11 23:40:01,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7648532569792412 [2022-12-11 23:40:01,947 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 26 predicate places. [2022-12-11 23:40:01,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 382 transitions, 3446 flow [2022-12-11 23:40:01,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 280 transitions, 2390 flow [2022-12-11 23:40:01,982 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 280 transitions, 2390 flow [2022-12-11 23:40:01,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.16666666666667) internal successors, (1106), 12 states have internal predecessors, (1106), 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-11 23:40:01,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:01,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:40:01,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:40:01,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -989684331, now seen corresponding path program 1 times [2022-12-11 23:40:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719739210] [2022-12-11 23:40:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:02,608 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-11 23:40:02,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:02,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719739210] [2022-12-11 23:40:02,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719739210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:02,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:02,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579614663] [2022-12-11 23:40:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:02,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:02,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 127 [2022-12-11 23:40:02,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 280 transitions, 2390 flow. Second operand has 10 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 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-11 23:40:02,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:02,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 127 [2022-12-11 23:40:02,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:03,780 INFO L130 PetriNetUnfolder]: 3014/7147 cut-off events. [2022-12-11 23:40:03,780 INFO L131 PetriNetUnfolder]: For 7579/24945 co-relation queries the response was YES. [2022-12-11 23:40:03,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30707 conditions, 7147 events. 3014/7147 cut-off events. For 7579/24945 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 64597 event pairs, 227 based on Foata normal form. 356/7351 useless extension candidates. Maximal degree in co-relation 30593. Up to 3677 conditions per place. [2022-12-11 23:40:03,817 INFO L137 encePairwiseOnDemand]: 110/127 looper letters, 193 selfloop transitions, 48 changer transitions 170/488 dead transitions. [2022-12-11 23:40:03,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 488 transitions, 5336 flow [2022-12-11 23:40:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 23:40:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 23:40:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1790 transitions. [2022-12-11 23:40:03,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7830271216097988 [2022-12-11 23:40:03,822 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 31 predicate places. [2022-12-11 23:40:03,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 488 transitions, 5336 flow [2022-12-11 23:40:03,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 318 transitions, 3262 flow [2022-12-11 23:40:03,853 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 318 transitions, 3262 flow [2022-12-11 23:40:03,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 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-11 23:40:03,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:03,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:40:03,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:40:03,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash -633967948, now seen corresponding path program 1 times [2022-12-11 23:40:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121038986] [2022-12-11 23:40:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:03,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:04,910 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-11 23:40:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:04,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121038986] [2022-12-11 23:40:04,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121038986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:04,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:04,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:40:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054784168] [2022-12-11 23:40:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:04,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:40:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:40:04,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:40:04,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 127 [2022-12-11 23:40:04,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 318 transitions, 3262 flow. Second operand has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-11 23:40:04,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:04,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 127 [2022-12-11 23:40:04,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:06,107 INFO L130 PetriNetUnfolder]: 2349/5606 cut-off events. [2022-12-11 23:40:06,107 INFO L131 PetriNetUnfolder]: For 10270/67607 co-relation queries the response was YES. [2022-12-11 23:40:06,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28299 conditions, 5606 events. 2349/5606 cut-off events. For 10270/67607 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 48179 event pairs, 53 based on Foata normal form. 368/5809 useless extension candidates. Maximal degree in co-relation 28171. Up to 3118 conditions per place. [2022-12-11 23:40:06,148 INFO L137 encePairwiseOnDemand]: 113/127 looper letters, 217 selfloop transitions, 61 changer transitions 122/476 dead transitions. [2022-12-11 23:40:06,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 476 transitions, 6064 flow [2022-12-11 23:40:06,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 23:40:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 23:40:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1766 transitions. [2022-12-11 23:40:06,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7725284339457568 [2022-12-11 23:40:06,152 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 39 predicate places. [2022-12-11 23:40:06,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 476 transitions, 6064 flow [2022-12-11 23:40:06,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 354 transitions, 4304 flow [2022-12-11 23:40:06,182 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 354 transitions, 4304 flow [2022-12-11 23:40:06,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-11 23:40:06,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:06,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:40:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:40:06,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1452275196, now seen corresponding path program 2 times [2022-12-11 23:40:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327272564] [2022-12-11 23:40:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:06,983 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-11 23:40:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327272564] [2022-12-11 23:40:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327272564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:06,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:06,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:40:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213974510] [2022-12-11 23:40:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:40:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:06,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:40:06,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:40:06,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 127 [2022-12-11 23:40:06,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 354 transitions, 4304 flow. Second operand has 13 states, 13 states have (on average 99.6923076923077) internal successors, (1296), 13 states have internal predecessors, (1296), 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-11 23:40:06,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:06,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 127 [2022-12-11 23:40:06,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:07,853 INFO L130 PetriNetUnfolder]: 2319/5704 cut-off events. [2022-12-11 23:40:07,854 INFO L131 PetriNetUnfolder]: For 18095/57932 co-relation queries the response was YES. [2022-12-11 23:40:07,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30451 conditions, 5704 events. 2319/5704 cut-off events. For 18095/57932 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 49857 event pairs, 146 based on Foata normal form. 330/5850 useless extension candidates. Maximal degree in co-relation 30312. Up to 3074 conditions per place. [2022-12-11 23:40:07,897 INFO L137 encePairwiseOnDemand]: 113/127 looper letters, 171 selfloop transitions, 47 changer transitions 37/409 dead transitions. [2022-12-11 23:40:07,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 409 transitions, 5679 flow [2022-12-11 23:40:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:40:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:40:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1433 transitions. [2022-12-11 23:40:07,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8059617547806525 [2022-12-11 23:40:07,901 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 43 predicate places. [2022-12-11 23:40:07,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 409 transitions, 5679 flow [2022-12-11 23:40:07,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 372 transitions, 5037 flow [2022-12-11 23:40:07,936 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 372 transitions, 5037 flow [2022-12-11 23:40:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.6923076923077) internal successors, (1296), 13 states have internal predecessors, (1296), 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-11 23:40:07,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:07,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:40:07,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:40:07,937 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1164378622, now seen corresponding path program 3 times [2022-12-11 23:40:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:07,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072809796] [2022-12-11 23:40:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:08,504 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-11 23:40:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:08,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072809796] [2022-12-11 23:40:08,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072809796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:08,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87036960] [2022-12-11 23:40:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:08,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:08,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2022-12-11 23:40:08,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 372 transitions, 5037 flow. Second operand has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 12 states have internal predecessors, (1231), 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-11 23:40:08,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:08,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2022-12-11 23:40:08,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:09,548 INFO L130 PetriNetUnfolder]: 2341/5725 cut-off events. [2022-12-11 23:40:09,549 INFO L131 PetriNetUnfolder]: For 23316/51605 co-relation queries the response was YES. [2022-12-11 23:40:09,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33137 conditions, 5725 events. 2341/5725 cut-off events. For 23316/51605 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 50135 event pairs, 65 based on Foata normal form. 274/5868 useless extension candidates. Maximal degree in co-relation 32990. Up to 3120 conditions per place. [2022-12-11 23:40:09,596 INFO L137 encePairwiseOnDemand]: 115/127 looper letters, 148 selfloop transitions, 73 changer transitions 37/415 dead transitions. [2022-12-11 23:40:09,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 415 transitions, 6303 flow [2022-12-11 23:40:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1371 transitions. [2022-12-11 23:40:09,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8304058146577832 [2022-12-11 23:40:09,602 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 49 predicate places. [2022-12-11 23:40:09,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 415 transitions, 6303 flow [2022-12-11 23:40:09,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 378 transitions, 5587 flow [2022-12-11 23:40:09,637 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 378 transitions, 5587 flow [2022-12-11 23:40:09,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 12 states have internal predecessors, (1231), 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-11 23:40:09,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:09,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:40:09,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:40:09,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1753097426, now seen corresponding path program 4 times [2022-12-11 23:40:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:09,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715041891] [2022-12-11 23:40:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:10,479 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-11 23:40:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:10,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715041891] [2022-12-11 23:40:10,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715041891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:10,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:10,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623234979] [2022-12-11 23:40:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:10,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:10,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 127 [2022-12-11 23:40:10,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 378 transitions, 5587 flow. Second operand has 12 states, 12 states have (on average 93.16666666666667) internal successors, (1118), 12 states have internal predecessors, (1118), 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-11 23:40:10,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:10,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 127 [2022-12-11 23:40:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:11,870 INFO L130 PetriNetUnfolder]: 2665/6747 cut-off events. [2022-12-11 23:40:11,870 INFO L131 PetriNetUnfolder]: For 30113/128604 co-relation queries the response was YES. [2022-12-11 23:40:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43477 conditions, 6747 events. 2665/6747 cut-off events. For 30113/128604 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 63426 event pairs, 54 based on Foata normal form. 561/7145 useless extension candidates. Maximal degree in co-relation 43316. Up to 3732 conditions per place. [2022-12-11 23:40:11,917 INFO L137 encePairwiseOnDemand]: 110/127 looper letters, 225 selfloop transitions, 149 changer transitions 119/569 dead transitions. [2022-12-11 23:40:11,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 569 transitions, 9789 flow [2022-12-11 23:40:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 23:40:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 23:40:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1791 transitions. [2022-12-11 23:40:11,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7834645669291339 [2022-12-11 23:40:11,920 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 60 predicate places. [2022-12-11 23:40:11,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 569 transitions, 9789 flow [2022-12-11 23:40:11,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 450 transitions, 7603 flow [2022-12-11 23:40:11,961 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 450 transitions, 7603 flow [2022-12-11 23:40:11,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.16666666666667) internal successors, (1118), 12 states have internal predecessors, (1118), 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-11 23:40:11,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:11,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:40:11,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:40:11,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:11,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1195601416, now seen corresponding path program 1 times [2022-12-11 23:40:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:11,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477347165] [2022-12-11 23:40:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:11,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:12,134 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-11 23:40:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477347165] [2022-12-11 23:40:12,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477347165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:12,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:12,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:40:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768868133] [2022-12-11 23:40:12,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:12,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:40:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:40:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:40:12,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2022-12-11 23:40:12,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 450 transitions, 7603 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 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-11 23:40:12,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:12,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2022-12-11 23:40:12,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:18,612 INFO L130 PetriNetUnfolder]: 26680/45892 cut-off events. [2022-12-11 23:40:18,613 INFO L131 PetriNetUnfolder]: For 763888/870039 co-relation queries the response was YES. [2022-12-11 23:40:18,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252943 conditions, 45892 events. 26680/45892 cut-off events. For 763888/870039 co-relation queries the response was YES. Maximal size of possible extension queue 2958. Compared 427387 event pairs, 571 based on Foata normal form. 3205/46925 useless extension candidates. Maximal degree in co-relation 252778. Up to 16885 conditions per place. [2022-12-11 23:40:18,974 INFO L137 encePairwiseOnDemand]: 116/127 looper letters, 719 selfloop transitions, 20 changer transitions 176/1128 dead transitions. [2022-12-11 23:40:18,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1128 transitions, 23739 flow [2022-12-11 23:40:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:40:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:40:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1102 transitions. [2022-12-11 23:40:18,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8677165354330708 [2022-12-11 23:40:18,977 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 60 predicate places. [2022-12-11 23:40:18,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 1128 transitions, 23739 flow [2022-12-11 23:40:19,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 952 transitions, 19515 flow [2022-12-11 23:40:19,259 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 952 transitions, 19515 flow [2022-12-11 23:40:19,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 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-11 23:40:19,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:19,259 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:19,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:40:19,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2126175862, now seen corresponding path program 1 times [2022-12-11 23:40:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972961664] [2022-12-11 23:40:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:19,414 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-11 23:40:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:19,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972961664] [2022-12-11 23:40:19,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972961664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:19,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:19,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:40:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107684802] [2022-12-11 23:40:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:19,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:40:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:40:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:40:19,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2022-12-11 23:40:19,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 952 transitions, 19515 flow. Second operand has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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-11 23:40:19,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:19,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2022-12-11 23:40:19,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:27,975 INFO L130 PetriNetUnfolder]: 23078/44055 cut-off events. [2022-12-11 23:40:27,975 INFO L131 PetriNetUnfolder]: For 708333/809178 co-relation queries the response was YES. [2022-12-11 23:40:28,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243865 conditions, 44055 events. 23078/44055 cut-off events. For 708333/809178 co-relation queries the response was YES. Maximal size of possible extension queue 3237. Compared 470097 event pairs, 222 based on Foata normal form. 5043/47354 useless extension candidates. Maximal degree in co-relation 243696. Up to 14267 conditions per place. [2022-12-11 23:40:28,302 INFO L137 encePairwiseOnDemand]: 116/127 looper letters, 1261 selfloop transitions, 54 changer transitions 132/1647 dead transitions. [2022-12-11 23:40:28,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1647 transitions, 38130 flow [2022-12-11 23:40:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1436 transitions. [2022-12-11 23:40:28,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8697758933979406 [2022-12-11 23:40:28,305 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 72 predicate places. [2022-12-11 23:40:28,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 1647 transitions, 38130 flow [2022-12-11 23:40:28,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 1515 transitions, 34698 flow [2022-12-11 23:40:28,485 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 1515 transitions, 34698 flow [2022-12-11 23:40:28,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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-11 23:40:28,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:28,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:28,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:40:28,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1275574635, now seen corresponding path program 1 times [2022-12-11 23:40:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:28,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799628851] [2022-12-11 23:40:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:28,655 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-11 23:40:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799628851] [2022-12-11 23:40:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799628851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:28,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:28,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:40:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107075946] [2022-12-11 23:40:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:28,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:40:28,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:40:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:40:28,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2022-12-11 23:40:28,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 1515 transitions, 34698 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-11 23:40:28,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:28,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2022-12-11 23:40:28,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:37,992 INFO L130 PetriNetUnfolder]: 30306/58043 cut-off events. [2022-12-11 23:40:37,992 INFO L131 PetriNetUnfolder]: For 1149064/1287652 co-relation queries the response was YES. [2022-12-11 23:40:38,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340561 conditions, 58043 events. 30306/58043 cut-off events. For 1149064/1287652 co-relation queries the response was YES. Maximal size of possible extension queue 4072. Compared 639947 event pairs, 321 based on Foata normal form. 4826/60825 useless extension candidates. Maximal degree in co-relation 340388. Up to 18907 conditions per place. [2022-12-11 23:40:38,508 INFO L137 encePairwiseOnDemand]: 121/127 looper letters, 795 selfloop transitions, 25 changer transitions 1072/2119 dead transitions. [2022-12-11 23:40:38,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 2119 transitions, 54082 flow [2022-12-11 23:40:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:40:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:40:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 997 transitions. [2022-12-11 23:40:38,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8722659667541557 [2022-12-11 23:40:38,510 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 80 predicate places. [2022-12-11 23:40:38,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 2119 transitions, 54082 flow [2022-12-11 23:40:38,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 1047 transitions, 24224 flow [2022-12-11 23:40:38,633 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 1047 transitions, 24224 flow [2022-12-11 23:40:38,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-11 23:40:38,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:38,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:38,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:40:38,634 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash -283304557, now seen corresponding path program 1 times [2022-12-11 23:40:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536056093] [2022-12-11 23:40:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:38,802 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-11 23:40:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536056093] [2022-12-11 23:40:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536056093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:38,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:38,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295630317] [2022-12-11 23:40:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:38,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:38,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2022-12-11 23:40:38,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 1047 transitions, 24224 flow. Second operand has 8 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 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-11 23:40:38,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:38,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2022-12-11 23:40:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:46,933 INFO L130 PetriNetUnfolder]: 15846/34176 cut-off events. [2022-12-11 23:40:46,933 INFO L131 PetriNetUnfolder]: For 591248/739595 co-relation queries the response was YES. [2022-12-11 23:40:47,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194800 conditions, 34176 events. 15846/34176 cut-off events. For 591248/739595 co-relation queries the response was YES. Maximal size of possible extension queue 2723. Compared 398518 event pairs, 134 based on Foata normal form. 3576/36543 useless extension candidates. Maximal degree in co-relation 194623. Up to 9921 conditions per place. [2022-12-11 23:40:47,214 INFO L137 encePairwiseOnDemand]: 116/127 looper letters, 764 selfloop transitions, 106 changer transitions 281/1311 dead transitions. [2022-12-11 23:40:47,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1311 transitions, 32441 flow [2022-12-11 23:40:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:40:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:40:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1769 transitions. [2022-12-11 23:40:47,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8705708661417323 [2022-12-11 23:40:47,218 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 89 predicate places. [2022-12-11 23:40:47,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 1311 transitions, 32441 flow [2022-12-11 23:40:47,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 1030 transitions, 24976 flow [2022-12-11 23:40:47,338 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1030 transitions, 24976 flow [2022-12-11 23:40:47,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 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-11 23:40:47,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:47,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:47,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:40:47,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:47,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 500102771, now seen corresponding path program 1 times [2022-12-11 23:40:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:47,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587520826] [2022-12-11 23:40:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:47,818 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-11 23:40:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:47,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587520826] [2022-12-11 23:40:47,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587520826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:47,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:47,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:40:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680798218] [2022-12-11 23:40:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:47,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:40:47,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:40:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:40:47,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2022-12-11 23:40:47,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1030 transitions, 24976 flow. Second operand has 9 states, 9 states have (on average 103.11111111111111) internal successors, (928), 9 states have internal predecessors, (928), 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-11 23:40:47,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:47,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2022-12-11 23:40:47,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:54,695 INFO L130 PetriNetUnfolder]: 14031/31563 cut-off events. [2022-12-11 23:40:54,696 INFO L131 PetriNetUnfolder]: For 467757/545655 co-relation queries the response was YES. [2022-12-11 23:40:54,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192890 conditions, 31563 events. 14031/31563 cut-off events. For 467757/545655 co-relation queries the response was YES. Maximal size of possible extension queue 2743. Compared 379246 event pairs, 129 based on Foata normal form. 3100/33628 useless extension candidates. Maximal degree in co-relation 192709. Up to 8947 conditions per place. [2022-12-11 23:40:54,881 INFO L137 encePairwiseOnDemand]: 116/127 looper letters, 600 selfloop transitions, 101 changer transitions 224/1053 dead transitions. [2022-12-11 23:40:54,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1053 transitions, 27126 flow [2022-12-11 23:40:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:40:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:40:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2061 transitions. [2022-12-11 23:40:54,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8541234977206796 [2022-12-11 23:40:54,884 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 107 predicate places. [2022-12-11 23:40:54,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 1053 transitions, 27126 flow [2022-12-11 23:40:54,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 829 transitions, 20939 flow [2022-12-11 23:40:54,961 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 829 transitions, 20939 flow [2022-12-11 23:40:54,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.11111111111111) internal successors, (928), 9 states have internal predecessors, (928), 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-11 23:40:54,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:54,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:54,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 23:40:54,962 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1005758102, now seen corresponding path program 1 times [2022-12-11 23:40:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:54,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848225198] [2022-12-11 23:40:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:55,445 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-11 23:40:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848225198] [2022-12-11 23:40:55,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848225198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:55,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:55,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873182419] [2022-12-11 23:40:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:55,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:55,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 127 [2022-12-11 23:40:55,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 829 transitions, 20939 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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-11 23:40:55,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:55,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 127 [2022-12-11 23:40:55,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:41:01,864 INFO L130 PetriNetUnfolder]: 16978/37918 cut-off events. [2022-12-11 23:41:01,865 INFO L131 PetriNetUnfolder]: For 705094/816695 co-relation queries the response was YES. [2022-12-11 23:41:02,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259536 conditions, 37918 events. 16978/37918 cut-off events. For 705094/816695 co-relation queries the response was YES. Maximal size of possible extension queue 2853. Compared 458420 event pairs, 210 based on Foata normal form. 2183/39201 useless extension candidates. Maximal degree in co-relation 259341. Up to 9569 conditions per place. [2022-12-11 23:41:02,151 INFO L137 encePairwiseOnDemand]: 113/127 looper letters, 414 selfloop transitions, 62 changer transitions 952/1620 dead transitions. [2022-12-11 23:41:02,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1620 transitions, 48179 flow [2022-12-11 23:41:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:41:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:41:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 876 transitions. [2022-12-11 23:41:02,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7664041994750657 [2022-12-11 23:41:02,154 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 112 predicate places. [2022-12-11 23:41:02,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 1620 transitions, 48179 flow [2022-12-11 23:41:02,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 668 transitions, 16761 flow [2022-12-11 23:41:02,240 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 668 transitions, 16761 flow [2022-12-11 23:41:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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-11 23:41:02,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:41:02,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:41:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 23:41:02,241 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:41:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:41:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1669852400, now seen corresponding path program 2 times [2022-12-11 23:41:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:41:02,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851081737] [2022-12-11 23:41:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:41:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:41:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:41:02,747 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-11 23:41:02,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:41:02,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851081737] [2022-12-11 23:41:02,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851081737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:41:02,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:41:02,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:41:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488167254] [2022-12-11 23:41:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:41:02,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:41:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:41:02,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:41:02,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:41:02,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 127 [2022-12-11 23:41:02,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 668 transitions, 16761 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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-11 23:41:02,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:41:02,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 127 [2022-12-11 23:41:02,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:41:04,449 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([369] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][575], [319#(= ~y$r_buff0_thd0~0 0), 407#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y~0 ~y$w_buff0~0))), P3Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 50#L774true, P0Thread1of1ForFork2InUse, 167#true, 65#L3true, 61#L797true, 285#true, 446#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 248#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0)), 59#L814true, 465#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 559#(= ~a~0 1), 542#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 586#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 116#L752true, 474#true, 381#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), 141#true, 509#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 144#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 23:41:04,449 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 23:41:04,449 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 23:41:04,450 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 23:41:04,450 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 23:41:04,450 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([369] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][575], [319#(= ~y$r_buff0_thd0~0 0), 407#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y~0 ~y$w_buff0~0))), P3Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 50#L774true, P0Thread1of1ForFork2InUse, 167#true, 61#L797true, 128#L3-1true, 285#true, 446#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 248#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0)), 59#L814true, 465#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 559#(= ~a~0 1), 542#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 586#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 116#L752true, 474#true, 381#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), 141#true, 509#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 144#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 23:41:04,450 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 23:41:04,450 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 23:41:04,450 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 23:41:04,450 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 23:41:04,451 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([369] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][410], [319#(= ~y$r_buff0_thd0~0 0), 407#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y~0 ~y$w_buff0~0))), P3Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 50#L774true, P0Thread1of1ForFork2InUse, 167#true, 61#L797true, 444#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 505#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 285#true, 248#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0)), 463#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 59#L814true, 559#(= ~a~0 1), 536#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 586#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 116#L752true, 474#true, 381#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), 141#true, 78#L2true, 144#true, 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))]) [2022-12-11 23:41:04,451 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 23:41:04,451 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 23:41:04,451 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 23:41:04,451 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 23:41:06,830 INFO L130 PetriNetUnfolder]: 12136/28953 cut-off events. [2022-12-11 23:41:06,831 INFO L131 PetriNetUnfolder]: For 469645/535846 co-relation queries the response was YES. [2022-12-11 23:41:06,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186670 conditions, 28953 events. 12136/28953 cut-off events. For 469645/535846 co-relation queries the response was YES. Maximal size of possible extension queue 2080. Compared 350561 event pairs, 164 based on Foata normal form. 2023/30542 useless extension candidates. Maximal degree in co-relation 186461. Up to 7167 conditions per place. [2022-12-11 23:41:06,981 INFO L137 encePairwiseOnDemand]: 114/127 looper letters, 74 selfloop transitions, 19 changer transitions 846/1052 dead transitions. [2022-12-11 23:41:06,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1052 transitions, 30799 flow [2022-12-11 23:41:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:41:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:41:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-12-11 23:41:06,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7629046369203849 [2022-12-11 23:41:06,990 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 116 predicate places. [2022-12-11 23:41:06,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 1052 transitions, 30799 flow [2022-12-11 23:41:07,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 206 transitions, 3593 flow [2022-12-11 23:41:07,025 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 206 transitions, 3593 flow [2022-12-11 23:41:07,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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-11 23:41:07,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:41:07,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:41:07,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 23:41:07,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:41:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:41:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1610883580, now seen corresponding path program 3 times [2022-12-11 23:41:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:41:07,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755856719] [2022-12-11 23:41:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:41:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:41:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:41:08,193 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-11 23:41:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:41:08,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755856719] [2022-12-11 23:41:08,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755856719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:41:08,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:41:08,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 23:41:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952771434] [2022-12-11 23:41:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:41:08,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 23:41:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:41:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 23:41:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-11 23:41:08,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 127 [2022-12-11 23:41:08,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 206 transitions, 3593 flow. Second operand has 14 states, 14 states have (on average 98.78571428571429) internal successors, (1383), 14 states have internal predecessors, (1383), 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-11 23:41:08,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:41:08,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 127 [2022-12-11 23:41:08,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:41:08,818 INFO L130 PetriNetUnfolder]: 1087/4037 cut-off events. [2022-12-11 23:41:08,818 INFO L131 PetriNetUnfolder]: For 27489/28272 co-relation queries the response was YES. [2022-12-11 23:41:08,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21325 conditions, 4037 events. 1087/4037 cut-off events. For 27489/28272 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 44285 event pairs, 33 based on Foata normal form. 65/4089 useless extension candidates. Maximal degree in co-relation 21104. Up to 1325 conditions per place. [2022-12-11 23:41:08,835 INFO L137 encePairwiseOnDemand]: 117/127 looper letters, 49 selfloop transitions, 19 changer transitions 41/228 dead transitions. [2022-12-11 23:41:08,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 228 transitions, 4551 flow [2022-12-11 23:41:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:41:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:41:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1204 transitions. [2022-12-11 23:41:08,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7900262467191601 [2022-12-11 23:41:08,837 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 99 predicate places. [2022-12-11 23:41:08,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 228 transitions, 4551 flow [2022-12-11 23:41:08,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 187 transitions, 3161 flow [2022-12-11 23:41:08,845 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 187 transitions, 3161 flow [2022-12-11 23:41:08,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 98.78571428571429) internal successors, (1383), 14 states have internal predecessors, (1383), 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-11 23:41:08,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:41:08,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:41:08,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 23:41:08,846 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:41:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:41:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 611772508, now seen corresponding path program 4 times [2022-12-11 23:41:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:41:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811204490] [2022-12-11 23:41:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:41:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:41:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:41:08,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:41:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:41:08,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:41:08,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:41:08,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 23:41:08,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 23:41:08,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 23:41:08,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 23:41:08,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 23:41:08,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 23:41:08,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 23:41:08,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 23:41:08,953 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:41:08,960 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:41:08,960 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:41:09,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:41:09 BasicIcfg [2022-12-11 23:41:09,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:41:09,066 INFO L158 Benchmark]: Toolchain (without parser) took 78297.53ms. Allocated memory was 216.0MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 180.0MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-11 23:41:09,066 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 216.0MB. Free memory was 193.8MB in the beginning and 193.7MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:41:09,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.77ms. Allocated memory is still 216.0MB. Free memory was 179.5MB in the beginning and 152.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 23:41:09,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.86ms. Allocated memory is still 216.0MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:41:09,067 INFO L158 Benchmark]: Boogie Preprocessor took 41.02ms. Allocated memory is still 216.0MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:41:09,067 INFO L158 Benchmark]: RCFGBuilder took 584.30ms. Allocated memory is still 216.0MB. Free memory was 147.5MB in the beginning and 111.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-11 23:41:09,067 INFO L158 Benchmark]: TraceAbstraction took 77182.96ms. Allocated memory was 216.0MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 110.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-11 23:41:09,068 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.13ms. Allocated memory is still 216.0MB. Free memory was 193.8MB in the beginning and 193.7MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.77ms. Allocated memory is still 216.0MB. Free memory was 179.5MB in the beginning and 152.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.86ms. Allocated memory is still 216.0MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.02ms. Allocated memory is still 216.0MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 584.30ms. Allocated memory is still 216.0MB. Free memory was 147.5MB in the beginning and 111.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 77182.96ms. Allocated memory was 216.0MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 110.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t1433; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; VAL [__unbuffered_cnt=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, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; VAL [__unbuffered_cnt=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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 848]: 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: 844]: 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: 846]: 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: 842]: 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, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 77.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 64.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1763 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1763 mSDsluCounter, 2107 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1729 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3469 IncrementalHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 378 mSDtfsCounter, 3469 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34698occurred in iteration=12, InterpolantAutomatonStates: 259, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 122218 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1524 ConstructedInterpolants, 0 QuantifiedInterpolants, 9536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-11 23:41:09,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...