/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:08:35,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:08:35,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:08:35,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:08:35,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:08:35,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:08:35,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:08:35,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:08:35,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:08:35,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:08:35,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:08:35,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:08:35,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:08:35,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:08:35,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:08:35,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:08:35,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:08:35,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:08:35,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:08:35,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:08:35,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:08:35,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:08:35,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:08:35,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:08:35,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:08:35,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:08:35,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:08:35,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:08:35,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:08:35,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:08:35,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:08:35,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:08:35,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:08:35,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:08:35,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:08:35,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:08:35,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:08:35,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:08:35,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:08:35,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:08:35,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:08:35,257 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 19:08:35,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:08:35,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:08:35,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:08:35,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:08:35,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:08:35,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:08:35,277 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:08:35,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:08:35,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:08:35,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:08:35,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:08:35,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:08:35,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:08:35,280 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:08:35,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:08:35,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:08:35,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:08:35,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-11 19:08:35,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:08:35,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:08:35,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:08:35,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:08:35,504 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:08:35,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 19:08:36,442 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:08:36,645 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:08:36,645 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 19:08:36,656 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737bc54e1/9f7ba9a511eb464ca63767b416aa4c54/FLAG552eeecb5 [2022-12-11 19:08:36,676 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737bc54e1/9f7ba9a511eb464ca63767b416aa4c54 [2022-12-11 19:08:36,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:08:36,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:08:36,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:08:36,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:08:36,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:08:36,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:08:36" (1/1) ... [2022-12-11 19:08:36,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c8667d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:36, skipping insertion in model container [2022-12-11 19:08:36,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:08:36" (1/1) ... [2022-12-11 19:08:36,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:08:36,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:08:36,871 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-11 19:08:37,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:08:37,069 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:08:37,079 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-11 19:08:37,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:08:37,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:08:37,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:08:37,152 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:08:37,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37 WrapperNode [2022-12-11 19:08:37,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:08:37,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:08:37,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:08:37,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:08:37,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,195 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-11 19:08:37,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:08:37,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:08:37,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:08:37,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:08:37,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,212 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:08:37,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:08:37,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:08:37,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:08:37,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (1/1) ... [2022-12-11 19:08:37,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:08:37,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:08:37,240 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 19:08:37,242 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 19:08:37,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:08:37,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 19:08:37,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 19:08:37,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 19:08:37,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:08:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:08:37,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:08:37,268 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 19:08:37,352 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:08:37,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:08:37,612 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:08:37,713 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:08:37,713 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 19:08:37,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:08:37 BoogieIcfgContainer [2022-12-11 19:08:37,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:08:37,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:08:37,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:08:37,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:08:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:08:36" (1/3) ... [2022-12-11 19:08:37,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c89b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:08:37, skipping insertion in model container [2022-12-11 19:08:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:08:37" (2/3) ... [2022-12-11 19:08:37,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c89b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:08:37, skipping insertion in model container [2022-12-11 19:08:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:08:37" (3/3) ... [2022-12-11 19:08:37,721 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 19:08:37,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:08:37,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 19:08:37,749 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:08:37,812 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 19:08:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-11 19:08:37,896 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-11 19:08:37,896 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:08:37,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-11 19:08:37,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-11 19:08:37,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-11 19:08:37,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:08:37,922 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;@61d14fcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:08:37,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 19:08:37,968 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-11 19:08:37,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:08:37,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:37,969 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] [2022-12-11 19:08:37,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1990581890, now seen corresponding path program 1 times [2022-12-11 19:08:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:37,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93553887] [2022-12-11 19:08:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:38,407 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 19:08:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93553887] [2022-12-11 19:08:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93553887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:38,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 19:08:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875769700] [2022-12-11 19:08:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:08:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:38,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:08:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:08:38,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2022-12-11 19:08:38,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 19:08:38,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:38,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2022-12-11 19:08:38,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:38,605 INFO L130 PetriNetUnfolder]: 58/443 cut-off events. [2022-12-11 19:08:38,605 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 19:08:38,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 443 events. 58/443 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2267 event pairs, 44 based on Foata normal form. 15/426 useless extension candidates. Maximal degree in co-relation 525. Up to 79 conditions per place. [2022-12-11 19:08:38,613 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 14 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2022-12-11 19:08:38,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 255 flow [2022-12-11 19:08:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:08:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:08:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2022-12-11 19:08:38,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-12-11 19:08:38,634 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 213 flow. Second operand 3 states and 294 transitions. [2022-12-11 19:08:38,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 255 flow [2022-12-11 19:08:38,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-11 19:08:38,640 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 206 flow [2022-12-11 19:08:38,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2022-12-11 19:08:38,644 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, -3 predicate places. [2022-12-11 19:08:38,645 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 206 flow [2022-12-11 19:08:38,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 19:08:38,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:38,646 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] [2022-12-11 19:08:38,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:08:38,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash 333501338, now seen corresponding path program 1 times [2022-12-11 19:08:38,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:38,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075848886] [2022-12-11 19:08:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:39,840 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 19:08:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:39,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075848886] [2022-12-11 19:08:39,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075848886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:39,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:39,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:08:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760157757] [2022-12-11 19:08:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:39,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:08:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:08:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:08:39,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 19:08:39,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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 19:08:39,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:39,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 19:08:39,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:40,654 INFO L130 PetriNetUnfolder]: 1430/3431 cut-off events. [2022-12-11 19:08:40,654 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-11 19:08:40,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 3431 events. 1430/3431 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 26455 event pairs, 283 based on Foata normal form. 0/3321 useless extension candidates. Maximal degree in co-relation 5714. Up to 1072 conditions per place. [2022-12-11 19:08:40,670 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 38 selfloop transitions, 11 changer transitions 85/195 dead transitions. [2022-12-11 19:08:40,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 195 transitions, 672 flow [2022-12-11 19:08:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:08:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:08:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1077 transitions. [2022-12-11 19:08:40,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.789010989010989 [2022-12-11 19:08:40,674 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 206 flow. Second operand 13 states and 1077 transitions. [2022-12-11 19:08:40,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 195 transitions, 672 flow [2022-12-11 19:08:40,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 195 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:08:40,679 INFO L231 Difference]: Finished difference. Result has 128 places, 96 transitions, 291 flow [2022-12-11 19:08:40,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=291, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-12-11 19:08:40,679 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 18 predicate places. [2022-12-11 19:08:40,679 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 291 flow [2022-12-11 19:08:40,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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 19:08:40,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:40,680 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] [2022-12-11 19:08:40,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:08:40,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2005852229, now seen corresponding path program 1 times [2022-12-11 19:08:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:40,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642310983] [2022-12-11 19:08:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:41,109 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 19:08:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:41,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642310983] [2022-12-11 19:08:41,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642310983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:41,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:41,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:08:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233928845] [2022-12-11 19:08:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:41,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:08:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:08:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:08:41,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-11 19:08:41,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 291 flow. Second operand has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 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 19:08:41,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:41,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-11 19:08:41,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:41,506 INFO L130 PetriNetUnfolder]: 812/1537 cut-off events. [2022-12-11 19:08:41,506 INFO L131 PetriNetUnfolder]: For 4342/4946 co-relation queries the response was YES. [2022-12-11 19:08:41,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5767 conditions, 1537 events. 812/1537 cut-off events. For 4342/4946 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8754 event pairs, 183 based on Foata normal form. 96/1590 useless extension candidates. Maximal degree in co-relation 5705. Up to 779 conditions per place. [2022-12-11 19:08:41,518 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 24 selfloop transitions, 14 changer transitions 58/170 dead transitions. [2022-12-11 19:08:41,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 170 transitions, 909 flow [2022-12-11 19:08:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 19:08:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 19:08:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1225 transitions. [2022-12-11 19:08:41,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-12-11 19:08:41,521 INFO L175 Difference]: Start difference. First operand has 128 places, 96 transitions, 291 flow. Second operand 14 states and 1225 transitions. [2022-12-11 19:08:41,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 170 transitions, 909 flow [2022-12-11 19:08:41,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 170 transitions, 873 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-11 19:08:41,538 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 445 flow [2022-12-11 19:08:41,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=445, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2022-12-11 19:08:41,540 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 17 predicate places. [2022-12-11 19:08:41,540 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 445 flow [2022-12-11 19:08:41,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 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 19:08:41,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:41,541 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] [2022-12-11 19:08:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:08:41,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 90708846, now seen corresponding path program 1 times [2022-12-11 19:08:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:41,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058187264] [2022-12-11 19:08:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:42,224 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 19:08:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:42,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058187264] [2022-12-11 19:08:42,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058187264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:42,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:42,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:08:42,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748313049] [2022-12-11 19:08:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:42,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:08:42,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:08:42,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:08:42,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 19:08:42,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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 19:08:42,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:42,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 19:08:42,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:42,831 INFO L130 PetriNetUnfolder]: 914/1650 cut-off events. [2022-12-11 19:08:42,832 INFO L131 PetriNetUnfolder]: For 8945/11248 co-relation queries the response was YES. [2022-12-11 19:08:42,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8111 conditions, 1650 events. 914/1650 cut-off events. For 8945/11248 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8605 event pairs, 132 based on Foata normal form. 48/1643 useless extension candidates. Maximal degree in co-relation 8033. Up to 727 conditions per place. [2022-12-11 19:08:42,843 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 59 selfloop transitions, 13 changer transitions 71/204 dead transitions. [2022-12-11 19:08:42,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 204 transitions, 1601 flow [2022-12-11 19:08:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:08:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:08:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1056 transitions. [2022-12-11 19:08:42,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7736263736263737 [2022-12-11 19:08:42,846 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 445 flow. Second operand 13 states and 1056 transitions. [2022-12-11 19:08:42,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 204 transitions, 1601 flow [2022-12-11 19:08:42,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 204 transitions, 1575 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-11 19:08:42,863 INFO L231 Difference]: Finished difference. Result has 138 places, 116 transitions, 620 flow [2022-12-11 19:08:42,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=620, PETRI_PLACES=138, PETRI_TRANSITIONS=116} [2022-12-11 19:08:42,865 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 28 predicate places. [2022-12-11 19:08:42,865 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 116 transitions, 620 flow [2022-12-11 19:08:42,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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 19:08:42,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:42,865 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] [2022-12-11 19:08:42,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:08:42,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:42,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1567787703, now seen corresponding path program 1 times [2022-12-11 19:08:42,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:42,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704940842] [2022-12-11 19:08:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:42,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:43,517 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 19:08:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704940842] [2022-12-11 19:08:43,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704940842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:43,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:43,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:08:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198584502] [2022-12-11 19:08:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:43,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:08:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:43,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:08:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:08:43,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 19:08:43,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 116 transitions, 620 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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 19:08:43,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:43,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 19:08:43,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:43,956 INFO L130 PetriNetUnfolder]: 828/1788 cut-off events. [2022-12-11 19:08:43,956 INFO L131 PetriNetUnfolder]: For 11995/16621 co-relation queries the response was YES. [2022-12-11 19:08:43,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8981 conditions, 1788 events. 828/1788 cut-off events. For 11995/16621 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11040 event pairs, 166 based on Foata normal form. 34/1760 useless extension candidates. Maximal degree in co-relation 8893. Up to 739 conditions per place. [2022-12-11 19:08:43,970 INFO L137 encePairwiseOnDemand]: 97/105 looper letters, 57 selfloop transitions, 8 changer transitions 41/167 dead transitions. [2022-12-11 19:08:43,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 167 transitions, 1345 flow [2022-12-11 19:08:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:08:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:08:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 806 transitions. [2022-12-11 19:08:43,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7676190476190476 [2022-12-11 19:08:43,972 INFO L175 Difference]: Start difference. First operand has 138 places, 116 transitions, 620 flow. Second operand 10 states and 806 transitions. [2022-12-11 19:08:43,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 167 transitions, 1345 flow [2022-12-11 19:08:44,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 167 transitions, 1269 flow, removed 36 selfloop flow, removed 7 redundant places. [2022-12-11 19:08:44,006 INFO L231 Difference]: Finished difference. Result has 138 places, 111 transitions, 566 flow [2022-12-11 19:08:44,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=566, PETRI_PLACES=138, PETRI_TRANSITIONS=111} [2022-12-11 19:08:44,009 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 28 predicate places. [2022-12-11 19:08:44,009 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 111 transitions, 566 flow [2022-12-11 19:08:44,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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 19:08:44,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:44,010 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] [2022-12-11 19:08:44,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:08:44,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1503456643, now seen corresponding path program 1 times [2022-12-11 19:08:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76529797] [2022-12-11 19:08:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:44,581 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 19:08:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:44,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76529797] [2022-12-11 19:08:44,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76529797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:44,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:44,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 19:08:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864513270] [2022-12-11 19:08:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:08:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:08:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-11 19:08:44,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2022-12-11 19:08:44,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 111 transitions, 566 flow. Second operand has 12 states, 12 states have (on average 81.33333333333333) internal successors, (976), 12 states have internal predecessors, (976), 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 19:08:44,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:44,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2022-12-11 19:08:44,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:44,989 INFO L130 PetriNetUnfolder]: 541/1227 cut-off events. [2022-12-11 19:08:44,989 INFO L131 PetriNetUnfolder]: For 9014/10865 co-relation queries the response was YES. [2022-12-11 19:08:44,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6188 conditions, 1227 events. 541/1227 cut-off events. For 9014/10865 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7093 event pairs, 171 based on Foata normal form. 100/1268 useless extension candidates. Maximal degree in co-relation 6157. Up to 714 conditions per place. [2022-12-11 19:08:44,999 INFO L137 encePairwiseOnDemand]: 91/105 looper letters, 26 selfloop transitions, 21 changer transitions 42/163 dead transitions. [2022-12-11 19:08:44,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 163 transitions, 1233 flow [2022-12-11 19:08:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 19:08:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 19:08:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1350 transitions. [2022-12-11 19:08:45,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8035714285714286 [2022-12-11 19:08:45,002 INFO L175 Difference]: Start difference. First operand has 138 places, 111 transitions, 566 flow. Second operand 16 states and 1350 transitions. [2022-12-11 19:08:45,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 163 transitions, 1233 flow [2022-12-11 19:08:45,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 163 transitions, 1187 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-11 19:08:45,023 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 689 flow [2022-12-11 19:08:45,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=689, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2022-12-11 19:08:45,026 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 40 predicate places. [2022-12-11 19:08:45,026 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 689 flow [2022-12-11 19:08:45,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.33333333333333) internal successors, (976), 12 states have internal predecessors, (976), 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 19:08:45,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:45,027 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] [2022-12-11 19:08:45,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:08:45,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1061439649, now seen corresponding path program 1 times [2022-12-11 19:08:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440496274] [2022-12-11 19:08:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:08:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440496274] [2022-12-11 19:08:45,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440496274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:45,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:45,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:08:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055961199] [2022-12-11 19:08:45,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:08:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:08:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:08:45,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 19:08:45,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 689 flow. Second operand has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 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 19:08:45,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:45,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 19:08:45,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:46,584 INFO L130 PetriNetUnfolder]: 696/1515 cut-off events. [2022-12-11 19:08:46,585 INFO L131 PetriNetUnfolder]: For 13367/18564 co-relation queries the response was YES. [2022-12-11 19:08:46,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8545 conditions, 1515 events. 696/1515 cut-off events. For 13367/18564 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8822 event pairs, 182 based on Foata normal form. 34/1474 useless extension candidates. Maximal degree in co-relation 8509. Up to 732 conditions per place. [2022-12-11 19:08:46,599 INFO L137 encePairwiseOnDemand]: 88/105 looper letters, 49 selfloop transitions, 28 changer transitions 52/190 dead transitions. [2022-12-11 19:08:46,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 190 transitions, 1798 flow [2022-12-11 19:08:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:08:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:08:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1341 transitions. [2022-12-11 19:08:46,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7512605042016807 [2022-12-11 19:08:46,603 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 689 flow. Second operand 17 states and 1341 transitions. [2022-12-11 19:08:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 190 transitions, 1798 flow [2022-12-11 19:08:46,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 190 transitions, 1656 flow, removed 68 selfloop flow, removed 12 redundant places. [2022-12-11 19:08:46,623 INFO L231 Difference]: Finished difference. Result has 157 places, 121 transitions, 836 flow [2022-12-11 19:08:46,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=836, PETRI_PLACES=157, PETRI_TRANSITIONS=121} [2022-12-11 19:08:46,624 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 47 predicate places. [2022-12-11 19:08:46,624 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 121 transitions, 836 flow [2022-12-11 19:08:46,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 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 19:08:46,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:46,625 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] [2022-12-11 19:08:46,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 19:08:46,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 629008826, now seen corresponding path program 1 times [2022-12-11 19:08:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31435791] [2022-12-11 19:08:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:47,353 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 19:08:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:47,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31435791] [2022-12-11 19:08:47,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31435791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:47,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:47,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 19:08:47,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699528016] [2022-12-11 19:08:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:47,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 19:08:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 19:08:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-11 19:08:47,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2022-12-11 19:08:47,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 121 transitions, 836 flow. Second operand has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 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 19:08:47,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:47,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2022-12-11 19:08:47,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:47,907 INFO L130 PetriNetUnfolder]: 771/1691 cut-off events. [2022-12-11 19:08:47,907 INFO L131 PetriNetUnfolder]: For 22177/28777 co-relation queries the response was YES. [2022-12-11 19:08:47,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11068 conditions, 1691 events. 771/1691 cut-off events. For 22177/28777 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10179 event pairs, 180 based on Foata normal form. 62/1676 useless extension candidates. Maximal degree in co-relation 11028. Up to 727 conditions per place. [2022-12-11 19:08:47,922 INFO L137 encePairwiseOnDemand]: 91/105 looper letters, 57 selfloop transitions, 28 changer transitions 80/227 dead transitions. [2022-12-11 19:08:47,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 227 transitions, 2814 flow [2022-12-11 19:08:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:08:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:08:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1361 transitions. [2022-12-11 19:08:47,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7624649859943977 [2022-12-11 19:08:47,925 INFO L175 Difference]: Start difference. First operand has 157 places, 121 transitions, 836 flow. Second operand 17 states and 1361 transitions. [2022-12-11 19:08:47,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 227 transitions, 2814 flow [2022-12-11 19:08:47,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 227 transitions, 2590 flow, removed 107 selfloop flow, removed 16 redundant places. [2022-12-11 19:08:47,953 INFO L231 Difference]: Finished difference. Result has 159 places, 132 transitions, 1083 flow [2022-12-11 19:08:47,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1083, PETRI_PLACES=159, PETRI_TRANSITIONS=132} [2022-12-11 19:08:47,954 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 49 predicate places. [2022-12-11 19:08:47,954 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 132 transitions, 1083 flow [2022-12-11 19:08:47,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 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 19:08:47,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:47,954 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] [2022-12-11 19:08:47,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:08:47,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1723693943, now seen corresponding path program 1 times [2022-12-11 19:08:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:47,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725112442] [2022-12-11 19:08:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:48,461 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 19:08:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:48,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725112442] [2022-12-11 19:08:48,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725112442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:48,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:48,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:08:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392817111] [2022-12-11 19:08:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:48,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:08:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:08:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:08:48,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 19:08:48,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 132 transitions, 1083 flow. Second operand has 8 states, 8 states have (on average 75.875) internal successors, (607), 8 states have internal predecessors, (607), 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 19:08:48,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:48,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 19:08:48,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:48,873 INFO L130 PetriNetUnfolder]: 849/1862 cut-off events. [2022-12-11 19:08:48,873 INFO L131 PetriNetUnfolder]: For 26139/46317 co-relation queries the response was YES. [2022-12-11 19:08:48,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13290 conditions, 1862 events. 849/1862 cut-off events. For 26139/46317 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12061 event pairs, 132 based on Foata normal form. 41/1816 useless extension candidates. Maximal degree in co-relation 13251. Up to 873 conditions per place. [2022-12-11 19:08:48,889 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 72 selfloop transitions, 10 changer transitions 79/222 dead transitions. [2022-12-11 19:08:48,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 222 transitions, 2840 flow [2022-12-11 19:08:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:08:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:08:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 657 transitions. [2022-12-11 19:08:48,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7821428571428571 [2022-12-11 19:08:48,892 INFO L175 Difference]: Start difference. First operand has 159 places, 132 transitions, 1083 flow. Second operand 8 states and 657 transitions. [2022-12-11 19:08:48,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 222 transitions, 2840 flow [2022-12-11 19:08:48,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 222 transitions, 2707 flow, removed 58 selfloop flow, removed 7 redundant places. [2022-12-11 19:08:48,927 INFO L231 Difference]: Finished difference. Result has 154 places, 120 transitions, 852 flow [2022-12-11 19:08:48,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=154, PETRI_TRANSITIONS=120} [2022-12-11 19:08:48,928 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 44 predicate places. [2022-12-11 19:08:48,929 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 120 transitions, 852 flow [2022-12-11 19:08:48,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.875) internal successors, (607), 8 states have internal predecessors, (607), 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 19:08:48,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:48,929 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] [2022-12-11 19:08:48,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 19:08:48,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash 257125575, now seen corresponding path program 2 times [2022-12-11 19:08:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:48,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133027673] [2022-12-11 19:08:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:49,470 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 19:08:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:49,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133027673] [2022-12-11 19:08:49,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133027673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:49,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:49,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 19:08:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935202438] [2022-12-11 19:08:49,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:49,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:08:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:49,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:08:49,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-11 19:08:49,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 105 [2022-12-11 19:08:49,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 120 transitions, 852 flow. Second operand has 12 states, 12 states have (on average 79.58333333333333) internal successors, (955), 12 states have internal predecessors, (955), 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 19:08:49,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:49,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 105 [2022-12-11 19:08:49,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:49,846 INFO L130 PetriNetUnfolder]: 395/1021 cut-off events. [2022-12-11 19:08:49,846 INFO L131 PetriNetUnfolder]: For 16498/18997 co-relation queries the response was YES. [2022-12-11 19:08:49,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 1021 events. 395/1021 cut-off events. For 16498/18997 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6008 event pairs, 124 based on Foata normal form. 91/1061 useless extension candidates. Maximal degree in co-relation 6744. Up to 486 conditions per place. [2022-12-11 19:08:49,855 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 39 selfloop transitions, 18 changer transitions 32/160 dead transitions. [2022-12-11 19:08:49,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 160 transitions, 1700 flow [2022-12-11 19:08:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 19:08:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 19:08:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1150 transitions. [2022-12-11 19:08:49,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.782312925170068 [2022-12-11 19:08:49,858 INFO L175 Difference]: Start difference. First operand has 154 places, 120 transitions, 852 flow. Second operand 14 states and 1150 transitions. [2022-12-11 19:08:49,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 160 transitions, 1700 flow [2022-12-11 19:08:49,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 160 transitions, 1587 flow, removed 13 selfloop flow, removed 10 redundant places. [2022-12-11 19:08:49,876 INFO L231 Difference]: Finished difference. Result has 161 places, 122 transitions, 910 flow [2022-12-11 19:08:49,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=910, PETRI_PLACES=161, PETRI_TRANSITIONS=122} [2022-12-11 19:08:49,878 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 51 predicate places. [2022-12-11 19:08:49,878 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 122 transitions, 910 flow [2022-12-11 19:08:49,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.58333333333333) internal successors, (955), 12 states have internal predecessors, (955), 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 19:08:49,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:49,878 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] [2022-12-11 19:08:49,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 19:08:49,879 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2215645, now seen corresponding path program 1 times [2022-12-11 19:08:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:49,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697138489] [2022-12-11 19:08:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:50,587 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 19:08:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:50,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697138489] [2022-12-11 19:08:50,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697138489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:50,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:50,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:08:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839153446] [2022-12-11 19:08:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:50,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:08:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:08:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:08:50,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-12-11 19:08:50,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 122 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 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 19:08:50,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:50,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-12-11 19:08:50,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:50,959 INFO L130 PetriNetUnfolder]: 429/1076 cut-off events. [2022-12-11 19:08:50,959 INFO L131 PetriNetUnfolder]: For 17642/21413 co-relation queries the response was YES. [2022-12-11 19:08:50,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7538 conditions, 1076 events. 429/1076 cut-off events. For 17642/21413 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6274 event pairs, 114 based on Foata normal form. 29/1058 useless extension candidates. Maximal degree in co-relation 7496. Up to 545 conditions per place. [2022-12-11 19:08:50,970 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 61 selfloop transitions, 16 changer transitions 50/190 dead transitions. [2022-12-11 19:08:50,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 190 transitions, 2438 flow [2022-12-11 19:08:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:08:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:08:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 975 transitions. [2022-12-11 19:08:50,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7738095238095238 [2022-12-11 19:08:50,972 INFO L175 Difference]: Start difference. First operand has 161 places, 122 transitions, 910 flow. Second operand 12 states and 975 transitions. [2022-12-11 19:08:50,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 190 transitions, 2438 flow [2022-12-11 19:08:50,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 190 transitions, 2387 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-12-11 19:08:50,993 INFO L231 Difference]: Finished difference. Result has 165 places, 130 transitions, 1075 flow [2022-12-11 19:08:50,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1075, PETRI_PLACES=165, PETRI_TRANSITIONS=130} [2022-12-11 19:08:50,994 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 55 predicate places. [2022-12-11 19:08:50,994 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 130 transitions, 1075 flow [2022-12-11 19:08:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 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 19:08:50,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:50,994 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] [2022-12-11 19:08:50,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 19:08:50,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1633861097, now seen corresponding path program 1 times [2022-12-11 19:08:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123845007] [2022-12-11 19:08:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:51,133 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 19:08:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:51,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123845007] [2022-12-11 19:08:51,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123845007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:51,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:51,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:08:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461715783] [2022-12-11 19:08:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:08:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:08:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:08:51,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-11 19:08:51,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 130 transitions, 1075 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 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 19:08:51,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:51,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-11 19:08:51,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:51,792 INFO L130 PetriNetUnfolder]: 2232/4289 cut-off events. [2022-12-11 19:08:51,792 INFO L131 PetriNetUnfolder]: For 111527/112742 co-relation queries the response was YES. [2022-12-11 19:08:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27026 conditions, 4289 events. 2232/4289 cut-off events. For 111527/112742 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 31810 event pairs, 142 based on Foata normal form. 387/4437 useless extension candidates. Maximal degree in co-relation 26979. Up to 1479 conditions per place. [2022-12-11 19:08:51,824 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 73 selfloop transitions, 7 changer transitions 120/279 dead transitions. [2022-12-11 19:08:51,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 279 transitions, 3927 flow [2022-12-11 19:08:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:08:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:08:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 892 transitions. [2022-12-11 19:08:51,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8495238095238096 [2022-12-11 19:08:51,826 INFO L175 Difference]: Start difference. First operand has 165 places, 130 transitions, 1075 flow. Second operand 10 states and 892 transitions. [2022-12-11 19:08:51,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 279 transitions, 3927 flow [2022-12-11 19:08:51,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 279 transitions, 3746 flow, removed 73 selfloop flow, removed 5 redundant places. [2022-12-11 19:08:51,886 INFO L231 Difference]: Finished difference. Result has 169 places, 128 transitions, 979 flow [2022-12-11 19:08:51,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=979, PETRI_PLACES=169, PETRI_TRANSITIONS=128} [2022-12-11 19:08:51,887 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 59 predicate places. [2022-12-11 19:08:51,887 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 128 transitions, 979 flow [2022-12-11 19:08:51,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 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 19:08:51,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:51,888 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] [2022-12-11 19:08:51,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 19:08:51,888 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash 812645655, now seen corresponding path program 1 times [2022-12-11 19:08:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:51,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285959036] [2022-12-11 19:08:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:52,409 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 19:08:52,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:52,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285959036] [2022-12-11 19:08:52,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285959036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:52,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:52,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:08:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270248371] [2022-12-11 19:08:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:52,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:08:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:08:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:08:52,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 19:08:52,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 128 transitions, 979 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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 19:08:52,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:52,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 19:08:52,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:52,863 INFO L130 PetriNetUnfolder]: 635/1971 cut-off events. [2022-12-11 19:08:52,864 INFO L131 PetriNetUnfolder]: For 27251/27955 co-relation queries the response was YES. [2022-12-11 19:08:52,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11262 conditions, 1971 events. 635/1971 cut-off events. For 27251/27955 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15949 event pairs, 218 based on Foata normal form. 31/1869 useless extension candidates. Maximal degree in co-relation 11212. Up to 490 conditions per place. [2022-12-11 19:08:52,881 INFO L137 encePairwiseOnDemand]: 96/105 looper letters, 66 selfloop transitions, 6 changer transitions 44/181 dead transitions. [2022-12-11 19:08:52,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 181 transitions, 2157 flow [2022-12-11 19:08:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:08:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:08:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 724 transitions. [2022-12-11 19:08:52,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7661375661375661 [2022-12-11 19:08:52,882 INFO L175 Difference]: Start difference. First operand has 169 places, 128 transitions, 979 flow. Second operand 9 states and 724 transitions. [2022-12-11 19:08:52,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 181 transitions, 2157 flow [2022-12-11 19:08:52,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 181 transitions, 2078 flow, removed 37 selfloop flow, removed 7 redundant places. [2022-12-11 19:08:52,910 INFO L231 Difference]: Finished difference. Result has 171 places, 126 transitions, 952 flow [2022-12-11 19:08:52,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=952, PETRI_PLACES=171, PETRI_TRANSITIONS=126} [2022-12-11 19:08:52,911 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 61 predicate places. [2022-12-11 19:08:52,912 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 126 transitions, 952 flow [2022-12-11 19:08:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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 19:08:52,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:52,913 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] [2022-12-11 19:08:52,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 19:08:52,913 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1144716601, now seen corresponding path program 2 times [2022-12-11 19:08:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:52,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42039898] [2022-12-11 19:08:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:53,030 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 19:08:53,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:53,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42039898] [2022-12-11 19:08:53,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42039898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:53,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:53,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:08:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689841242] [2022-12-11 19:08:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:53,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:08:53,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:08:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:08:53,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-11 19:08:53,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 126 transitions, 952 flow. Second operand has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 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 19:08:53,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:53,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-11 19:08:53,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:53,506 INFO L130 PetriNetUnfolder]: 829/2003 cut-off events. [2022-12-11 19:08:53,507 INFO L131 PetriNetUnfolder]: For 40243/40658 co-relation queries the response was YES. [2022-12-11 19:08:53,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12005 conditions, 2003 events. 829/2003 cut-off events. For 40243/40658 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14582 event pairs, 85 based on Foata normal form. 185/2153 useless extension candidates. Maximal degree in co-relation 11955. Up to 549 conditions per place. [2022-12-11 19:08:53,518 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 63 selfloop transitions, 10 changer transitions 75/224 dead transitions. [2022-12-11 19:08:53,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 224 transitions, 2877 flow [2022-12-11 19:08:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:08:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:08:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2022-12-11 19:08:53,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8502164502164502 [2022-12-11 19:08:53,521 INFO L175 Difference]: Start difference. First operand has 171 places, 126 transitions, 952 flow. Second operand 11 states and 982 transitions. [2022-12-11 19:08:53,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 224 transitions, 2877 flow [2022-12-11 19:08:53,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 224 transitions, 2747 flow, removed 49 selfloop flow, removed 9 redundant places. [2022-12-11 19:08:53,553 INFO L231 Difference]: Finished difference. Result has 173 places, 123 transitions, 886 flow [2022-12-11 19:08:53,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=886, PETRI_PLACES=173, PETRI_TRANSITIONS=123} [2022-12-11 19:08:53,554 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 63 predicate places. [2022-12-11 19:08:53,554 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 123 transitions, 886 flow [2022-12-11 19:08:53,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 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 19:08:53,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:53,554 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] [2022-12-11 19:08:53,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 19:08:53,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1399996620, now seen corresponding path program 1 times [2022-12-11 19:08:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:53,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301758165] [2022-12-11 19:08:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:53,718 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 19:08:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:53,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301758165] [2022-12-11 19:08:53,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301758165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:53,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:53,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:08:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365914253] [2022-12-11 19:08:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:08:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:08:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:08:53,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-11 19:08:53,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 123 transitions, 886 flow. Second operand has 8 states, 8 states have (on average 83.125) internal successors, (665), 8 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 19:08:53,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:53,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-11 19:08:53,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:54,009 INFO L130 PetriNetUnfolder]: 368/1097 cut-off events. [2022-12-11 19:08:54,009 INFO L131 PetriNetUnfolder]: For 17324/17430 co-relation queries the response was YES. [2022-12-11 19:08:54,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6380 conditions, 1097 events. 368/1097 cut-off events. For 17324/17430 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7616 event pairs, 70 based on Foata normal form. 66/1141 useless extension candidates. Maximal degree in co-relation 6329. Up to 265 conditions per place. [2022-12-11 19:08:54,015 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 34 selfloop transitions, 14 changer transitions 48/168 dead transitions. [2022-12-11 19:08:54,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 168 transitions, 1775 flow [2022-12-11 19:08:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:08:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:08:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1036 transitions. [2022-12-11 19:08:54,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2022-12-11 19:08:54,017 INFO L175 Difference]: Start difference. First operand has 173 places, 123 transitions, 886 flow. Second operand 12 states and 1036 transitions. [2022-12-11 19:08:54,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 168 transitions, 1775 flow [2022-12-11 19:08:54,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 168 transitions, 1438 flow, removed 157 selfloop flow, removed 18 redundant places. [2022-12-11 19:08:54,038 INFO L231 Difference]: Finished difference. Result has 169 places, 109 transitions, 621 flow [2022-12-11 19:08:54,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=621, PETRI_PLACES=169, PETRI_TRANSITIONS=109} [2022-12-11 19:08:54,039 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 59 predicate places. [2022-12-11 19:08:54,039 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 109 transitions, 621 flow [2022-12-11 19:08:54,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.125) internal successors, (665), 8 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 19:08:54,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:54,040 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 19:08:54,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 19:08:54,040 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1356119628, now seen corresponding path program 1 times [2022-12-11 19:08:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:54,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129391646] [2022-12-11 19:08:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:54,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:55,165 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 19:08:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129391646] [2022-12-11 19:08:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129391646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:55,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:55,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 19:08:55,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477975258] [2022-12-11 19:08:55,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:55,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 19:08:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:55,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 19:08:55,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-11 19:08:55,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 105 [2022-12-11 19:08:55,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 109 transitions, 621 flow. Second operand has 14 states, 14 states have (on average 77.71428571428571) internal successors, (1088), 14 states have internal predecessors, (1088), 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 19:08:55,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:55,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 105 [2022-12-11 19:08:55,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:55,400 INFO L130 PetriNetUnfolder]: 75/522 cut-off events. [2022-12-11 19:08:55,400 INFO L131 PetriNetUnfolder]: For 2094/2120 co-relation queries the response was YES. [2022-12-11 19:08:55,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 522 events. 75/522 cut-off events. For 2094/2120 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3357 event pairs, 5 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 1893. Up to 110 conditions per place. [2022-12-11 19:08:55,403 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 33 selfloop transitions, 9 changer transitions 13/130 dead transitions. [2022-12-11 19:08:55,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 130 transitions, 867 flow [2022-12-11 19:08:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:08:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:08:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 962 transitions. [2022-12-11 19:08:55,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7634920634920634 [2022-12-11 19:08:55,420 INFO L175 Difference]: Start difference. First operand has 169 places, 109 transitions, 621 flow. Second operand 12 states and 962 transitions. [2022-12-11 19:08:55,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 130 transitions, 867 flow [2022-12-11 19:08:55,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 130 transitions, 597 flow, removed 96 selfloop flow, removed 31 redundant places. [2022-12-11 19:08:55,427 INFO L231 Difference]: Finished difference. Result has 147 places, 106 transitions, 417 flow [2022-12-11 19:08:55,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=417, PETRI_PLACES=147, PETRI_TRANSITIONS=106} [2022-12-11 19:08:55,428 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 37 predicate places. [2022-12-11 19:08:55,430 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 106 transitions, 417 flow [2022-12-11 19:08:55,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.71428571428571) internal successors, (1088), 14 states have internal predecessors, (1088), 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 19:08:55,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:55,431 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 19:08:55,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 19:08:55,431 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -660906046, now seen corresponding path program 2 times [2022-12-11 19:08:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:55,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785626324] [2022-12-11 19:08:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:08:56,007 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 19:08:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:08:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785626324] [2022-12-11 19:08:56,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785626324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:08:56,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:08:56,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 19:08:56,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304492902] [2022-12-11 19:08:56,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:08:56,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:08:56,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:08:56,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:08:56,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-11 19:08:56,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 105 [2022-12-11 19:08:56,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 106 transitions, 417 flow. Second operand has 12 states, 12 states have (on average 79.83333333333333) internal successors, (958), 12 states have internal predecessors, (958), 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 19:08:56,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:08:56,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 105 [2022-12-11 19:08:56,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:08:56,194 INFO L130 PetriNetUnfolder]: 66/513 cut-off events. [2022-12-11 19:08:56,194 INFO L131 PetriNetUnfolder]: For 508/515 co-relation queries the response was YES. [2022-12-11 19:08:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 513 events. 66/513 cut-off events. For 508/515 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3466 event pairs, 7 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 1296. Up to 70 conditions per place. [2022-12-11 19:08:56,197 INFO L137 encePairwiseOnDemand]: 94/105 looper letters, 22 selfloop transitions, 10 changer transitions 7/116 dead transitions. [2022-12-11 19:08:56,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 116 transitions, 541 flow [2022-12-11 19:08:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:08:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:08:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 813 transitions. [2022-12-11 19:08:56,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7742857142857142 [2022-12-11 19:08:56,200 INFO L175 Difference]: Start difference. First operand has 147 places, 106 transitions, 417 flow. Second operand 10 states and 813 transitions. [2022-12-11 19:08:56,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 116 transitions, 541 flow [2022-12-11 19:08:56,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 116 transitions, 492 flow, removed 10 selfloop flow, removed 15 redundant places. [2022-12-11 19:08:56,204 INFO L231 Difference]: Finished difference. Result has 141 places, 106 transitions, 414 flow [2022-12-11 19:08:56,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=414, PETRI_PLACES=141, PETRI_TRANSITIONS=106} [2022-12-11 19:08:56,204 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 31 predicate places. [2022-12-11 19:08:56,205 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 106 transitions, 414 flow [2022-12-11 19:08:56,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.83333333333333) internal successors, (958), 12 states have internal predecessors, (958), 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 19:08:56,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:08:56,206 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 19:08:56,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 19:08:56,206 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:08:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:08:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1209731086, now seen corresponding path program 3 times [2022-12-11 19:08:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:08:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545768825] [2022-12-11 19:08:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:08:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:08:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:08:56,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 19:08:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:08:56,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 19:08:56,312 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 19:08:56,313 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 19:08:56,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 19:08:56,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 19:08:56,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 19:08:56,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 19:08:56,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 19:08:56,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 19:08:56,315 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:08:56,320 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 19:08:56,320 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 19:08:56,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 07:08:56 BasicIcfg [2022-12-11 19:08:56,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 19:08:56,406 INFO L158 Benchmark]: Toolchain (without parser) took 19726.34ms. Allocated memory was 179.3MB in the beginning and 739.2MB in the end (delta: 559.9MB). Free memory was 142.1MB in the beginning and 608.4MB in the end (delta: -466.3MB). Peak memory consumption was 94.2MB. Max. memory is 8.0GB. [2022-12-11 19:08:56,406 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory was 156.7MB in the beginning and 156.6MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 19:08:56,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.29ms. Allocated memory is still 179.3MB. Free memory was 142.1MB in the beginning and 116.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 19:08:56,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.27ms. Allocated memory is still 179.3MB. Free memory was 115.9MB in the beginning and 113.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:08:56,406 INFO L158 Benchmark]: Boogie Preprocessor took 19.62ms. Allocated memory is still 179.3MB. Free memory was 113.3MB in the beginning and 111.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:08:56,406 INFO L158 Benchmark]: RCFGBuilder took 499.54ms. Allocated memory is still 179.3MB. Free memory was 111.7MB in the beginning and 77.1MB in the end (delta: 34.7MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-11 19:08:56,407 INFO L158 Benchmark]: TraceAbstraction took 18688.16ms. Allocated memory was 179.3MB in the beginning and 739.2MB in the end (delta: 559.9MB). Free memory was 76.1MB in the beginning and 608.4MB in the end (delta: -532.4MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2022-12-11 19:08:56,408 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory was 156.7MB in the beginning and 156.6MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 472.29ms. Allocated memory is still 179.3MB. Free memory was 142.1MB in the beginning and 116.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.27ms. Allocated memory is still 179.3MB. Free memory was 115.9MB in the beginning and 113.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.62ms. Allocated memory is still 179.3MB. Free memory was 113.3MB in the beginning and 111.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 499.54ms. Allocated memory is still 179.3MB. Free memory was 111.7MB in the beginning and 77.1MB in the end (delta: 34.7MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18688.16ms. Allocated memory was 179.3MB in the beginning and 739.2MB in the end (delta: 559.9MB). Free memory was 76.1MB in the beginning and 608.4MB in the end (delta: -532.4MB). Peak memory consumption was 28.1MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1123 mSDsluCounter, 1423 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1146 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2624 IncrementalHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 277 mSDtfsCounter, 2624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1083occurred in iteration=8, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1207 ConstructedInterpolants, 0 QuantifiedInterpolants, 8315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 19:08:56,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...