/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:18:10,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:18:10,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:18:10,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:18:10,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:18:10,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:18:10,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:18:10,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:18:10,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:18:10,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:18:10,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:18:10,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:18:10,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:18:10,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:18:10,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:18:10,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:18:10,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:18:10,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:18:10,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:18:10,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:18:10,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:18:10,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:18:10,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:18:10,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:18:10,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:18:10,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:18:10,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:18:10,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:18:10,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:18:10,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:18:10,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:18:10,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:18:10,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:18:10,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:18:10,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:18:10,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:18:10,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:18:10,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:18:10,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:18:10,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:18:10,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:18:10,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:18:10,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:18:10,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:18:10,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:18:10,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:18:10,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:18:10,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:18:10,354 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:18:10,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:18:10,354 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:18:10,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:18:10,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:18:10,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:18:10,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:18:10,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:18:10,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:18:10,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:18:10,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:18:10,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:18:10,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:18:10,637 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:18:10,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:18:11,617 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:18:11,864 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:18:11,864 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:18:11,898 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715599313/b91f6fa080664df295a030da252b5be6/FLAGad3db346b [2022-12-05 20:18:11,910 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715599313/b91f6fa080664df295a030da252b5be6 [2022-12-05 20:18:11,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:18:11,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:18:11,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:18:11,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:18:11,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:18:11,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:18:11" (1/1) ... [2022-12-05 20:18:11,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1baa1b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:11, skipping insertion in model container [2022-12-05 20:18:11,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:18:11" (1/1) ... [2022-12-05 20:18:11,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:18:11,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:18:12,115 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/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:18:12,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:18:12,261 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:18:12,270 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/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:18:12,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:18:12,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:18:12,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:18:12,331 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:18:12,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12 WrapperNode [2022-12-05 20:18:12,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:18:12,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:18:12,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:18:12,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:18:12,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,366 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-05 20:18:12,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:18:12,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:18:12,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:18:12,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:18:12,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,384 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:18:12,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:18:12,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:18:12,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:18:12,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (1/1) ... [2022-12-05 20:18:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:18:12,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:18:12,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:18:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:18:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:18:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:18:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:18:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:18:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:18:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:18:12,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:18:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:18:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:18:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:18:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:18:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:18:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:18:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:18:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:18:12,475 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:18:12,638 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:18:12,639 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:18:12,945 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:18:13,050 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:18:13,050 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:18:13,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:18:13 BoogieIcfgContainer [2022-12-05 20:18:13,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:18:13,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:18:13,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:18:13,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:18:13,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:18:11" (1/3) ... [2022-12-05 20:18:13,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4edf11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:18:13, skipping insertion in model container [2022-12-05 20:18:13,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:18:12" (2/3) ... [2022-12-05 20:18:13,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4edf11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:18:13, skipping insertion in model container [2022-12-05 20:18:13,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:18:13" (3/3) ... [2022-12-05 20:18:13,059 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:18:13,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:18:13,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:18:13,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:18:13,114 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:18:13,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 20:18:13,207 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 20:18:13,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:18:13,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:18:13,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 20:18:13,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-05 20:18:13,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:18:13,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 20:18:13,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-05 20:18:13,262 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 20:18:13,262 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:18:13,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:18:13,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 20:18:13,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 2112 [2022-12-05 20:18:17,138 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-05 20:18:17,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:18:17,153 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;@6a4eedd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:18:17,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:18:17,155 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 20:18:17,155 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:18:17,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:17,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:18:17,156 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-05 20:18:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash 481440, now seen corresponding path program 1 times [2022-12-05 20:18:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:17,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106304254] [2022-12-05 20:18:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:17,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106304254] [2022-12-05 20:18:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106304254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:17,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:17,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:18:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807693503] [2022-12-05 20:18:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:17,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:18:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:18:17,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:18:17,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 20:18:17,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:17,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:17,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 20:18:17,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:17,688 INFO L130 PetriNetUnfolder]: 1106/1793 cut-off events. [2022-12-05 20:18:17,688 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 20:18:17,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 1793 events. 1106/1793 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10096 event pairs, 176 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 3476. Up to 1336 conditions per place. [2022-12-05 20:18:17,701 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 31 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-05 20:18:17,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 187 flow [2022-12-05 20:18:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:18:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:18:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-05 20:18:17,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-05 20:18:17,713 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 58 transitions. [2022-12-05 20:18:17,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 187 flow [2022-12-05 20:18:17,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:18:17,717 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 56 flow [2022-12-05 20:18:17,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-05 20:18:17,724 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-05 20:18:17,724 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 56 flow [2022-12-05 20:18:17,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:17,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:17,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:17,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:18:17,725 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-05 20:18:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash 874674193, now seen corresponding path program 1 times [2022-12-05 20:18:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:17,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183823493] [2022-12-05 20:18:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183823493] [2022-12-05 20:18:17,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183823493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:17,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:17,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:18:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627122893] [2022-12-05 20:18:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:17,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:18:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:17,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:18:17,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:18:17,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 20:18:17,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:17,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:17,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 20:18:17,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:18,319 INFO L130 PetriNetUnfolder]: 2459/3678 cut-off events. [2022-12-05 20:18:18,320 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-05 20:18:18,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7618 conditions, 3678 events. 2459/3678 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18080 event pairs, 815 based on Foata normal form. 112/3790 useless extension candidates. Maximal degree in co-relation 7608. Up to 2550 conditions per place. [2022-12-05 20:18:18,332 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-05 20:18:18,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 178 flow [2022-12-05 20:18:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:18:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:18:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-05 20:18:18,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 20:18:18,334 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 56 flow. Second operand 3 states and 42 transitions. [2022-12-05 20:18:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 178 flow [2022-12-05 20:18:18,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:18:18,336 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 106 flow [2022-12-05 20:18:18,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2022-12-05 20:18:18,336 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-12-05 20:18:18,337 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 106 flow [2022-12-05 20:18:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:18,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:18,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:18,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:18:18,337 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-05 20:18:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1345096319, now seen corresponding path program 1 times [2022-12-05 20:18:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:18,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698365047] [2022-12-05 20:18:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:18,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698365047] [2022-12-05 20:18:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698365047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:18,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:18,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:18:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992488980] [2022-12-05 20:18:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:18,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:18:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:18:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:18:18,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 20:18:18,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 106 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:18,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:18,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 20:18:18,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:18,715 INFO L130 PetriNetUnfolder]: 2285/3424 cut-off events. [2022-12-05 20:18:18,715 INFO L131 PetriNetUnfolder]: For 1371/1371 co-relation queries the response was YES. [2022-12-05 20:18:18,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8601 conditions, 3424 events. 2285/3424 cut-off events. For 1371/1371 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15955 event pairs, 664 based on Foata normal form. 50/3474 useless extension candidates. Maximal degree in co-relation 8589. Up to 1760 conditions per place. [2022-12-05 20:18:18,728 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 42 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2022-12-05 20:18:18,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 268 flow [2022-12-05 20:18:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:18:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:18:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:18:18,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-05 20:18:18,731 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 106 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:18:18,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 268 flow [2022-12-05 20:18:18,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:18:18,738 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 150 flow [2022-12-05 20:18:18,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-05 20:18:18,741 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2022-12-05 20:18:18,744 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 150 flow [2022-12-05 20:18:18,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:18,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:18,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:18:18,746 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-05 20:18:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1252445188, now seen corresponding path program 1 times [2022-12-05 20:18:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:18,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757428322] [2022-12-05 20:18:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:18,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:18,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757428322] [2022-12-05 20:18:18,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757428322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:18,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:18,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:18:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929364005] [2022-12-05 20:18:18,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:18,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:18:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:18:18,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:18:18,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 20:18:18,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 150 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:18,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:18,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 20:18:18,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:19,130 INFO L130 PetriNetUnfolder]: 2149/3224 cut-off events. [2022-12-05 20:18:19,131 INFO L131 PetriNetUnfolder]: For 2445/2445 co-relation queries the response was YES. [2022-12-05 20:18:19,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 3224 events. 2149/3224 cut-off events. For 2445/2445 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15459 event pairs, 438 based on Foata normal form. 40/3264 useless extension candidates. Maximal degree in co-relation 8587. Up to 1685 conditions per place. [2022-12-05 20:18:19,141 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 50 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2022-12-05 20:18:19,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 358 flow [2022-12-05 20:18:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:18:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:18:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 20:18:19,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 20:18:19,143 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 150 flow. Second operand 4 states and 51 transitions. [2022-12-05 20:18:19,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 358 flow [2022-12-05 20:18:19,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:18:19,149 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 226 flow [2022-12-05 20:18:19,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-05 20:18:19,150 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2022-12-05 20:18:19,150 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 226 flow [2022-12-05 20:18:19,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:19,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:19,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:18:19,151 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-05 20:18:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2145739495, now seen corresponding path program 1 times [2022-12-05 20:18:19,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:19,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124940828] [2022-12-05 20:18:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:19,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:19,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124940828] [2022-12-05 20:18:19,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124940828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:19,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:19,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:18:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185633887] [2022-12-05 20:18:19,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:19,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:18:19,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:18:19,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:18:19,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 20:18:19,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:19,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 20:18:19,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:19,355 INFO L130 PetriNetUnfolder]: 790/1407 cut-off events. [2022-12-05 20:18:19,356 INFO L131 PetriNetUnfolder]: For 1136/1178 co-relation queries the response was YES. [2022-12-05 20:18:19,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1407 events. 790/1407 cut-off events. For 1136/1178 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7542 event pairs, 207 based on Foata normal form. 98/1464 useless extension candidates. Maximal degree in co-relation 3602. Up to 1060 conditions per place. [2022-12-05 20:18:19,361 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 37 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2022-12-05 20:18:19,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 380 flow [2022-12-05 20:18:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:18:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:18:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 20:18:19,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-05 20:18:19,362 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 226 flow. Second operand 3 states and 46 transitions. [2022-12-05 20:18:19,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 380 flow [2022-12-05 20:18:19,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:18:19,365 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 248 flow [2022-12-05 20:18:19,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-05 20:18:19,366 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2022-12-05 20:18:19,366 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 248 flow [2022-12-05 20:18:19,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:19,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:19,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:18:19,366 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-05 20:18:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 941480330, now seen corresponding path program 1 times [2022-12-05 20:18:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:19,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696723104] [2022-12-05 20:18:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:19,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696723104] [2022-12-05 20:18:19,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696723104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:19,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:19,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:18:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476833431] [2022-12-05 20:18:19,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:19,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:18:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:18:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:18:19,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 20:18:19,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:19,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 20:18:19,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:19,596 INFO L130 PetriNetUnfolder]: 405/786 cut-off events. [2022-12-05 20:18:19,597 INFO L131 PetriNetUnfolder]: For 652/675 co-relation queries the response was YES. [2022-12-05 20:18:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 786 events. 405/786 cut-off events. For 652/675 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3993 event pairs, 130 based on Foata normal form. 95/846 useless extension candidates. Maximal degree in co-relation 2402. Up to 260 conditions per place. [2022-12-05 20:18:19,600 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 48 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-05 20:18:19,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 480 flow [2022-12-05 20:18:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:18:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:18:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-05 20:18:19,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 20:18:19,601 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 248 flow. Second operand 4 states and 62 transitions. [2022-12-05 20:18:19,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 480 flow [2022-12-05 20:18:19,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:18:19,603 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 284 flow [2022-12-05 20:18:19,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-05 20:18:19,604 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-05 20:18:19,604 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 284 flow [2022-12-05 20:18:19,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:19,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:19,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:18:19,604 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-05 20:18:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 41923236, now seen corresponding path program 1 times [2022-12-05 20:18:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:19,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489116433] [2022-12-05 20:18:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489116433] [2022-12-05 20:18:19,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489116433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:19,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:19,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:18:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541747073] [2022-12-05 20:18:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:19,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:18:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:18:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:18:19,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 20:18:19,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 284 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:19,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 20:18:19,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:19,983 INFO L130 PetriNetUnfolder]: 791/1407 cut-off events. [2022-12-05 20:18:19,983 INFO L131 PetriNetUnfolder]: For 3042/3042 co-relation queries the response was YES. [2022-12-05 20:18:19,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 1407 events. 791/1407 cut-off events. For 3042/3042 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6942 event pairs, 82 based on Foata normal form. 10/1417 useless extension candidates. Maximal degree in co-relation 5081. Up to 471 conditions per place. [2022-12-05 20:18:19,989 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 21 changer transitions 23/108 dead transitions. [2022-12-05 20:18:19,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 858 flow [2022-12-05 20:18:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:18:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:18:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-05 20:18:19,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:18:19,990 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 284 flow. Second operand 6 states and 75 transitions. [2022-12-05 20:18:19,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 858 flow [2022-12-05 20:18:19,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 804 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-05 20:18:19,997 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 358 flow [2022-12-05 20:18:19,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-05 20:18:19,997 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-05 20:18:19,997 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 358 flow [2022-12-05 20:18:19,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:19,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:19,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:19,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:18:19,998 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-05 20:18:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1187184174, now seen corresponding path program 2 times [2022-12-05 20:18:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:19,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496514576] [2022-12-05 20:18:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496514576] [2022-12-05 20:18:20,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496514576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:20,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:20,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:18:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351190210] [2022-12-05 20:18:20,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:20,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:18:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:18:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:18:20,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 20:18:20,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:20,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:20,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 20:18:20,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:20,277 INFO L130 PetriNetUnfolder]: 430/841 cut-off events. [2022-12-05 20:18:20,277 INFO L131 PetriNetUnfolder]: For 1377/1398 co-relation queries the response was YES. [2022-12-05 20:18:20,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 841 events. 430/841 cut-off events. For 1377/1398 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4452 event pairs, 137 based on Foata normal form. 36/856 useless extension candidates. Maximal degree in co-relation 2747. Up to 318 conditions per place. [2022-12-05 20:18:20,280 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 39 selfloop transitions, 10 changer transitions 17/77 dead transitions. [2022-12-05 20:18:20,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 628 flow [2022-12-05 20:18:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:18:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:18:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-05 20:18:20,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-05 20:18:20,282 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 358 flow. Second operand 5 states and 66 transitions. [2022-12-05 20:18:20,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 628 flow [2022-12-05 20:18:20,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 607 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 20:18:20,285 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 263 flow [2022-12-05 20:18:20,285 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-05 20:18:20,286 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-05 20:18:20,286 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 263 flow [2022-12-05 20:18:20,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:20,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:20,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:20,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:18:20,286 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-05 20:18:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash 350390049, now seen corresponding path program 1 times [2022-12-05 20:18:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805007665] [2022-12-05 20:18:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:18:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:18:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:18:21,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805007665] [2022-12-05 20:18:21,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805007665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:18:21,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:18:21,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:18:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976036714] [2022-12-05 20:18:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:18:21,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:18:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:18:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:18:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:18:21,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 20:18:21,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 263 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:21,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:18:21,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 20:18:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:21,660 INFO L130 PetriNetUnfolder]: 446/822 cut-off events. [2022-12-05 20:18:21,660 INFO L131 PetriNetUnfolder]: For 2048/2048 co-relation queries the response was YES. [2022-12-05 20:18:21,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 822 events. 446/822 cut-off events. For 2048/2048 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3770 event pairs, 62 based on Foata normal form. 1/823 useless extension candidates. Maximal degree in co-relation 3023. Up to 239 conditions per place. [2022-12-05 20:18:21,663 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 47 selfloop transitions, 15 changer transitions 42/104 dead transitions. [2022-12-05 20:18:21,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 831 flow [2022-12-05 20:18:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:18:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:18:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-05 20:18:21,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2022-12-05 20:18:21,665 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 263 flow. Second operand 8 states and 83 transitions. [2022-12-05 20:18:21,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 831 flow [2022-12-05 20:18:21,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 749 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-05 20:18:21,671 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 276 flow [2022-12-05 20:18:21,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=276, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2022-12-05 20:18:21,671 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2022-12-05 20:18:21,671 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 276 flow [2022-12-05 20:18:21,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:18:21,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:18:21,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:21,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:18:21,672 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-05 20:18:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:18:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1253330559, now seen corresponding path program 2 times [2022-12-05 20:18:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:18:21,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770990159] [2022-12-05 20:18:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:18:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:18:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:18:21,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:18:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:18:21,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:18:21,768 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:18:21,769 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:18:21,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:18:21,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:18:21,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:18:21,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:18:21,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:18:21,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:18:21,771 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-05 20:18:21,775 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:18:21,775 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:18:21,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:18:21 BasicIcfg [2022-12-05 20:18:21,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:18:21,816 INFO L158 Benchmark]: Toolchain (without parser) took 9903.42ms. Allocated memory was 170.9MB in the beginning and 362.8MB in the end (delta: 191.9MB). Free memory was 136.5MB in the beginning and 313.1MB in the end (delta: -176.7MB). Peak memory consumption was 209.3MB. Max. memory is 8.0GB. [2022-12-05 20:18:21,817 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 170.9MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:18:21,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.61ms. Allocated memory is still 170.9MB. Free memory was 136.5MB in the beginning and 109.8MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:18:21,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.19ms. Allocated memory is still 170.9MB. Free memory was 109.8MB in the beginning and 107.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:18:21,817 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 170.9MB. Free memory was 107.1MB in the beginning and 105.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 20:18:21,817 INFO L158 Benchmark]: RCFGBuilder took 663.51ms. Allocated memory is still 170.9MB. Free memory was 105.6MB in the beginning and 71.0MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 20:18:21,817 INFO L158 Benchmark]: TraceAbstraction took 8763.18ms. Allocated memory was 170.9MB in the beginning and 362.8MB in the end (delta: 191.9MB). Free memory was 69.9MB in the beginning and 313.1MB in the end (delta: -243.2MB). Peak memory consumption was 143.2MB. Max. memory is 8.0GB. [2022-12-05 20:18:21,818 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 170.9MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.61ms. Allocated memory is still 170.9MB. Free memory was 136.5MB in the beginning and 109.8MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.19ms. Allocated memory is still 170.9MB. Free memory was 109.8MB in the beginning and 107.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 170.9MB. Free memory was 107.1MB in the beginning and 105.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 663.51ms. Allocated memory is still 170.9MB. Free memory was 105.6MB in the beginning and 71.0MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8763.18ms. Allocated memory was 170.9MB in the beginning and 362.8MB in the end (delta: 191.9MB). Free memory was 69.9MB in the beginning and 313.1MB in the end (delta: -243.2MB). Peak memory consumption was 143.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 117 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1840, independent: 1777, independent conditional: 1777, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1840, independent: 1777, independent conditional: 0, independent unconditional: 1777, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1840, independent: 1777, independent conditional: 0, independent unconditional: 1777, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1840, independent: 1777, independent conditional: 0, independent unconditional: 1777, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1366, independent: 1324, independent conditional: 0, independent unconditional: 1324, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1366, independent: 1316, independent conditional: 0, independent unconditional: 1316, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1840, independent: 453, independent conditional: 0, independent unconditional: 453, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1366, unknown conditional: 0, unknown unconditional: 1366] , Statistics on independence cache: Total cache size (in pairs): 2045, Positive cache size: 2003, Positive conditional cache size: 0, Positive unconditional cache size: 2003, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153, ((void *)0), P0, ((void *)0))=-3, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t154, ((void *)0), P1, ((void *)0))=-2, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t155, ((void *)0), P2, ((void *)0))=-1, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 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: 8.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 35 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=7, InterpolantAutomatonStates: 40, 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 1575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:18:21,848 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...