/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:30:55,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:30:55,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:30:56,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:30:56,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:30:56,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:30:56,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:30:56,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:30:56,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:30:56,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:30:56,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:30:56,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:30:56,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:30:56,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:30:56,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:30:56,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:30:56,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:30:56,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:30:56,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:30:56,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:30:56,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:30:56,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:30:56,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:30:56,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:30:56,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:30:56,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:30:56,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:30:56,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:30:56,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:30:56,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:30:56,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:30:56,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:30:56,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:30:56,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:30:56,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:30:56,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:30:56,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:30:56,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:30:56,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:30:56,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:30:56,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:30:56,064 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-12 18:30:56,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:30:56,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:30:56,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:30:56,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:30:56,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:30:56,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:30:56,096 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:30:56,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:30:56,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:30:56,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:30:56,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:30:56,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:30:56,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:30:56,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:30:56,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:30:56,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:30:56,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:30:56,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:30:56,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:30:56,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:30:56,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:30:56,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:30:56,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:30:56,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:30:56,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:30:56,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:30:56,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:30:56,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:30:56,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:30:56,099 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:30:56,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:30:56,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:30:56,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:30:56,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:30:56,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:30:56,425 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:30:56,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-12-12 18:30:57,514 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:30:57,856 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:30:57,857 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-12-12 18:30:57,877 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8578607f0/0c12a15365364d37b044fff54e030e70/FLAGff758b7db [2022-12-12 18:30:57,888 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8578607f0/0c12a15365364d37b044fff54e030e70 [2022-12-12 18:30:57,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:30:57,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:30:57,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:30:57,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:30:57,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:30:57,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:30:57" (1/1) ... [2022-12-12 18:30:57,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18755712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:57, skipping insertion in model container [2022-12-12 18:30:57,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:30:57" (1/1) ... [2022-12-12 18:30:57,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:30:57,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:30:58,064 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/mix005_tso.oepc.i[949,962] [2022-12-12 18:30:58,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:30:58,310 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:30:58,320 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/mix005_tso.oepc.i[949,962] [2022-12-12 18:30:58,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:58,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:58,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:30:58,439 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:30:58,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58 WrapperNode [2022-12-12 18:30:58,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:30:58,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:30:58,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:30:58,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:30:58,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,510 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-12 18:30:58,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:30:58,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:30:58,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:30:58,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:30:58,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,545 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:30:58,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:30:58,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:30:58,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:30:58,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (1/1) ... [2022-12-12 18:30:58,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:30:58,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:30:58,597 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-12 18:30:58,605 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-12 18:30:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:30:58,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:30:58,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:30:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:30:58,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 18:30:58,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 18:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:30:58,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:30:58,643 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:30:58,858 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:30:58,860 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:30:59,236 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:30:59,334 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:30:59,334 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:30:59,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:30:59 BoogieIcfgContainer [2022-12-12 18:30:59,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:30:59,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:30:59,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:30:59,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:30:59,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:30:57" (1/3) ... [2022-12-12 18:30:59,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e9aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:30:59, skipping insertion in model container [2022-12-12 18:30:59,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:58" (2/3) ... [2022-12-12 18:30:59,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e9aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:30:59, skipping insertion in model container [2022-12-12 18:30:59,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:30:59" (3/3) ... [2022-12-12 18:30:59,344 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2022-12-12 18:30:59,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:30:59,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:30:59,360 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:30:59,405 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:30:59,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 18:30:59,529 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 18:30:59,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:59,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 18:30:59,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 18:30:59,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-12 18:30:59,549 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:30:59,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 18:30:59,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-12 18:30:59,626 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 18:30:59,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:59,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 18:30:59,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 18:30:59,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 3272 [2022-12-12 18:31:10,188 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-12 18:31:10,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:31:10,216 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;@2855a71d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:31:10,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 18:31:10,223 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-12 18:31:10,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:31:10,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:10,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 18:31:10,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 555940396, now seen corresponding path program 1 times [2022-12-12 18:31:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:10,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899130425] [2022-12-12 18:31:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:10,650 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-12 18:31:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:10,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899130425] [2022-12-12 18:31:10,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899130425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:10,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:10,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:31:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559947228] [2022-12-12 18:31:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:10,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:31:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:10,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:31:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:31:10,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 78 [2022-12-12 18:31:10,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:10,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:10,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 78 [2022-12-12 18:31:10,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:19,052 INFO L130 PetriNetUnfolder]: 57424/81629 cut-off events. [2022-12-12 18:31:19,052 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-12 18:31:19,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157782 conditions, 81629 events. 57424/81629 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 4074. Compared 598895 event pairs, 22678 based on Foata normal form. 0/51066 useless extension candidates. Maximal degree in co-relation 157770. Up to 63597 conditions per place. [2022-12-12 18:31:19,363 INFO L137 encePairwiseOnDemand]: 74/78 looper letters, 44 selfloop transitions, 2 changer transitions 64/127 dead transitions. [2022-12-12 18:31:19,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 127 transitions, 492 flow [2022-12-12 18:31:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:31:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:31:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2022-12-12 18:31:19,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2022-12-12 18:31:19,380 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2022-12-12 18:31:19,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 127 transitions, 492 flow [2022-12-12 18:31:19,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 63 transitions, 236 flow [2022-12-12 18:31:19,487 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 236 flow [2022-12-12 18:31:19,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:19,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:19,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:19,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:31:19,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -77521807, now seen corresponding path program 1 times [2022-12-12 18:31:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:19,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692112014] [2022-12-12 18:31:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:31:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:19,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692112014] [2022-12-12 18:31:19,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692112014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:19,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:19,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865995996] [2022-12-12 18:31:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:19,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:19,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:19,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:19,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 18:31:19,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 18:31:19,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:19,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 18:31:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:22,357 INFO L130 PetriNetUnfolder]: 21719/29999 cut-off events. [2022-12-12 18:31:22,357 INFO L131 PetriNetUnfolder]: For 5404/5404 co-relation queries the response was YES. [2022-12-12 18:31:22,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82158 conditions, 29999 events. 21719/29999 cut-off events. For 5404/5404 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 168141 event pairs, 2409 based on Foata normal form. 504/26109 useless extension candidates. Maximal degree in co-relation 82143. Up to 21289 conditions per place. [2022-12-12 18:31:22,552 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 78 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2022-12-12 18:31:22,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 500 flow [2022-12-12 18:31:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:31:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:31:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-12 18:31:22,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36324786324786323 [2022-12-12 18:31:22,556 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -30 predicate places. [2022-12-12 18:31:22,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 91 transitions, 500 flow [2022-12-12 18:31:22,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 91 transitions, 500 flow [2022-12-12 18:31:22,684 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 91 transitions, 500 flow [2022-12-12 18:31:22,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 18:31:22,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:22,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:31:22,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1493049102, now seen corresponding path program 1 times [2022-12-12 18:31:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355746574] [2022-12-12 18:31:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:23,077 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-12 18:31:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:23,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355746574] [2022-12-12 18:31:23,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355746574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:23,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:23,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694368068] [2022-12-12 18:31:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:23,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:23,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:23,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 18:31:23,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 91 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-12 18:31:23,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:23,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 18:31:23,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:25,312 INFO L130 PetriNetUnfolder]: 20471/28450 cut-off events. [2022-12-12 18:31:25,312 INFO L131 PetriNetUnfolder]: For 5493/5493 co-relation queries the response was YES. [2022-12-12 18:31:25,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105018 conditions, 28450 events. 20471/28450 cut-off events. For 5493/5493 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 157585 event pairs, 971 based on Foata normal form. 360/24608 useless extension candidates. Maximal degree in co-relation 105000. Up to 21001 conditions per place. [2022-12-12 18:31:25,688 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 127 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2022-12-12 18:31:25,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 141 transitions, 1054 flow [2022-12-12 18:31:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:31:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:31:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-12 18:31:25,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-12 18:31:25,691 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -28 predicate places. [2022-12-12 18:31:25,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 141 transitions, 1054 flow [2022-12-12 18:31:25,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 141 transitions, 1054 flow [2022-12-12 18:31:25,797 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 141 transitions, 1054 flow [2022-12-12 18:31:25,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-12 18:31:25,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:25,797 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:25,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:31:25,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1192668314, now seen corresponding path program 1 times [2022-12-12 18:31:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:25,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440315586] [2022-12-12 18:31:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:26,330 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-12 18:31:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440315586] [2022-12-12 18:31:26,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440315586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:26,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:26,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387892366] [2022-12-12 18:31:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:26,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:26,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:26,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:31:26,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 141 transitions, 1054 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12 18:31:26,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:26,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:31:26,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:28,606 INFO L130 PetriNetUnfolder]: 20291/28183 cut-off events. [2022-12-12 18:31:28,607 INFO L131 PetriNetUnfolder]: For 16817/16817 co-relation queries the response was YES. [2022-12-12 18:31:28,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126493 conditions, 28183 events. 20291/28183 cut-off events. For 16817/16817 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 155642 event pairs, 817 based on Foata normal form. 50/24051 useless extension candidates. Maximal degree in co-relation 126472. Up to 21636 conditions per place. [2022-12-12 18:31:28,805 INFO L137 encePairwiseOnDemand]: 71/78 looper letters, 161 selfloop transitions, 25 changer transitions 0/209 dead transitions. [2022-12-12 18:31:28,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 209 transitions, 1969 flow [2022-12-12 18:31:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:31:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:31:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-12-12 18:31:28,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2022-12-12 18:31:28,808 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -25 predicate places. [2022-12-12 18:31:28,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 209 transitions, 1969 flow [2022-12-12 18:31:29,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 209 transitions, 1969 flow [2022-12-12 18:31:29,069 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 209 transitions, 1969 flow [2022-12-12 18:31:29,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12 18:31:29,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:29,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:29,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:31:29,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1696835270, now seen corresponding path program 1 times [2022-12-12 18:31:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:29,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111037599] [2022-12-12 18:31:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:29,664 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-12 18:31:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:29,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111037599] [2022-12-12 18:31:29,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111037599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:29,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:29,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021047579] [2022-12-12 18:31:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:29,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:29,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:29,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:29,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:31:29,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 209 transitions, 1969 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-12 18:31:29,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:29,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:31:29,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:32,070 INFO L130 PetriNetUnfolder]: 20483/28601 cut-off events. [2022-12-12 18:31:32,070 INFO L131 PetriNetUnfolder]: For 35478/35478 co-relation queries the response was YES. [2022-12-12 18:31:32,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150258 conditions, 28601 events. 20483/28601 cut-off events. For 35478/35478 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 161357 event pairs, 733 based on Foata normal form. 16/24435 useless extension candidates. Maximal degree in co-relation 150234. Up to 21937 conditions per place. [2022-12-12 18:31:32,281 INFO L137 encePairwiseOnDemand]: 70/78 looper letters, 191 selfloop transitions, 29 changer transitions 0/243 dead transitions. [2022-12-12 18:31:32,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 243 transitions, 2750 flow [2022-12-12 18:31:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:31:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:31:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-12-12 18:31:32,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38782051282051283 [2022-12-12 18:31:32,283 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2022-12-12 18:31:32,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 243 transitions, 2750 flow [2022-12-12 18:31:32,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 243 transitions, 2750 flow [2022-12-12 18:31:32,413 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 243 transitions, 2750 flow [2022-12-12 18:31:32,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-12 18:31:32,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:32,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:32,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:31:32,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 861965996, now seen corresponding path program 2 times [2022-12-12 18:31:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:32,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130976180] [2022-12-12 18:31:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:32,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:32,853 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-12 18:31:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130976180] [2022-12-12 18:31:32,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130976180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:32,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:32,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:31:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295548590] [2022-12-12 18:31:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:31:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:31:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:31:32,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:31:32,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 243 transitions, 2750 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-12 18:31:32,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:32,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:31:32,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:36,112 INFO L130 PetriNetUnfolder]: 24994/34494 cut-off events. [2022-12-12 18:31:36,112 INFO L131 PetriNetUnfolder]: For 81278/81278 co-relation queries the response was YES. [2022-12-12 18:31:36,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208710 conditions, 34494 events. 24994/34494 cut-off events. For 81278/81278 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 194309 event pairs, 899 based on Foata normal form. 400/29923 useless extension candidates. Maximal degree in co-relation 208683. Up to 26460 conditions per place. [2022-12-12 18:31:36,364 INFO L137 encePairwiseOnDemand]: 70/78 looper letters, 232 selfloop transitions, 41 changer transitions 0/296 dead transitions. [2022-12-12 18:31:36,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 296 transitions, 3933 flow [2022-12-12 18:31:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:31:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:31:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2022-12-12 18:31:36,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2022-12-12 18:31:36,368 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2022-12-12 18:31:36,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 296 transitions, 3933 flow [2022-12-12 18:31:36,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 296 transitions, 3933 flow [2022-12-12 18:31:36,546 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 296 transitions, 3933 flow [2022-12-12 18:31:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-12 18:31:36,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:36,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:36,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:31:36,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash -434408097, now seen corresponding path program 1 times [2022-12-12 18:31:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965782916] [2022-12-12 18:31:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:36,875 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-12 18:31:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:36,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965782916] [2022-12-12 18:31:36,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965782916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:36,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:36,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:31:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062458926] [2022-12-12 18:31:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:36,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:31:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:36,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:31:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:31:36,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 18:31:36,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 296 transitions, 3933 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-12 18:31:36,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:36,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 18:31:36,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:41,807 INFO L130 PetriNetUnfolder]: 36753/51207 cut-off events. [2022-12-12 18:31:41,807 INFO L131 PetriNetUnfolder]: For 122091/122091 co-relation queries the response was YES. [2022-12-12 18:31:42,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360137 conditions, 51207 events. 36753/51207 cut-off events. For 122091/122091 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 313387 event pairs, 679 based on Foata normal form. 588/43859 useless extension candidates. Maximal degree in co-relation 360107. Up to 39841 conditions per place. [2022-12-12 18:31:42,326 INFO L137 encePairwiseOnDemand]: 69/78 looper letters, 402 selfloop transitions, 28 changer transitions 133/574 dead transitions. [2022-12-12 18:31:42,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 574 transitions, 8832 flow [2022-12-12 18:31:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:31:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:31:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2022-12-12 18:31:42,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-12 18:31:42,328 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2022-12-12 18:31:42,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 574 transitions, 8832 flow [2022-12-12 18:31:42,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 441 transitions, 6780 flow [2022-12-12 18:31:42,567 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 441 transitions, 6780 flow [2022-12-12 18:31:42,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-12 18:31:42,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:42,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:42,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:31:42,567 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:42,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2006384935, now seen corresponding path program 2 times [2022-12-12 18:31:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:42,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003466695] [2022-12-12 18:31:42,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:42,732 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-12 18:31:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:42,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003466695] [2022-12-12 18:31:42,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003466695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:42,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:42,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953177300] [2022-12-12 18:31:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:42,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:31:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:31:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:31:42,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 18:31:42,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 441 transitions, 6780 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-12 18:31:42,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:42,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 18:31:42,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:49,268 INFO L130 PetriNetUnfolder]: 43029/60660 cut-off events. [2022-12-12 18:31:49,268 INFO L131 PetriNetUnfolder]: For 303231/306396 co-relation queries the response was YES. [2022-12-12 18:31:49,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451427 conditions, 60660 events. 43029/60660 cut-off events. For 303231/306396 co-relation queries the response was YES. Maximal size of possible extension queue 2198. Compared 397801 event pairs, 3606 based on Foata normal form. 860/51945 useless extension candidates. Maximal degree in co-relation 451394. Up to 49639 conditions per place. [2022-12-12 18:31:49,724 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 444 selfloop transitions, 99 changer transitions 3/598 dead transitions. [2022-12-12 18:31:49,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 598 transitions, 10378 flow [2022-12-12 18:31:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:31:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:31:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-12-12 18:31:49,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41452991452991456 [2022-12-12 18:31:49,726 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -11 predicate places. [2022-12-12 18:31:49,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 598 transitions, 10378 flow [2022-12-12 18:31:50,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 595 transitions, 10324 flow [2022-12-12 18:31:50,005 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 595 transitions, 10324 flow [2022-12-12 18:31:50,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-12 18:31:50,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:50,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:50,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:31:50,006 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash -304168128, now seen corresponding path program 1 times [2022-12-12 18:31:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:50,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788655052] [2022-12-12 18:31:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:50,157 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-12 18:31:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:50,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788655052] [2022-12-12 18:31:50,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788655052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:50,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:50,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:31:50,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831562704] [2022-12-12 18:31:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:50,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:50,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:50,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 18:31:50,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 595 transitions, 10324 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-12 18:31:50,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:50,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 18:31:50,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:55,160 INFO L130 PetriNetUnfolder]: 25279/38010 cut-off events. [2022-12-12 18:31:55,160 INFO L131 PetriNetUnfolder]: For 221927/226979 co-relation queries the response was YES. [2022-12-12 18:31:55,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314734 conditions, 38010 events. 25279/38010 cut-off events. For 221927/226979 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 265098 event pairs, 1584 based on Foata normal form. 3318/35634 useless extension candidates. Maximal degree in co-relation 314698. Up to 30523 conditions per place. [2022-12-12 18:31:55,476 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 437 selfloop transitions, 183 changer transitions 18/690 dead transitions. [2022-12-12 18:31:55,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 690 transitions, 13272 flow [2022-12-12 18:31:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:31:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:31:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-12-12 18:31:55,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2022-12-12 18:31:55,478 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -8 predicate places. [2022-12-12 18:31:55,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 690 transitions, 13272 flow [2022-12-12 18:31:55,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 672 transitions, 12912 flow [2022-12-12 18:31:55,673 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 672 transitions, 12912 flow [2022-12-12 18:31:55,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-12 18:31:55,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:55,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:55,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:31:55,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:31:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash -466189096, now seen corresponding path program 1 times [2022-12-12 18:31:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:55,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542157117] [2022-12-12 18:31:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:55,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:55,855 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-12 18:31:55,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:55,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542157117] [2022-12-12 18:31:55,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542157117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:55,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:55,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:31:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060125873] [2022-12-12 18:31:55,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:55,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:55,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2022-12-12 18:31:55,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 672 transitions, 12912 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-12 18:31:55,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:55,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2022-12-12 18:31:55,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:03,298 INFO L130 PetriNetUnfolder]: 35508/54969 cut-off events. [2022-12-12 18:32:03,299 INFO L131 PetriNetUnfolder]: For 342869/347110 co-relation queries the response was YES. [2022-12-12 18:32:03,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494988 conditions, 54969 events. 35508/54969 cut-off events. For 342869/347110 co-relation queries the response was YES. Maximal size of possible extension queue 2464. Compared 429816 event pairs, 3286 based on Foata normal form. 1347/47895 useless extension candidates. Maximal degree in co-relation 494949. Up to 44700 conditions per place. [2022-12-12 18:32:03,838 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 766 selfloop transitions, 36 changer transitions 200/1058 dead transitions. [2022-12-12 18:32:03,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 1058 transitions, 22612 flow [2022-12-12 18:32:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:32:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:32:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-12-12 18:32:03,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-12 18:32:03,846 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2022-12-12 18:32:03,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 1058 transitions, 22612 flow [2022-12-12 18:32:04,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 858 transitions, 18212 flow [2022-12-12 18:32:04,091 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 858 transitions, 18212 flow [2022-12-12 18:32:04,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-12 18:32:04,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:04,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:04,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:32:04,092 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash -342058218, now seen corresponding path program 1 times [2022-12-12 18:32:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:04,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825956564] [2022-12-12 18:32:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:04,521 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-12 18:32:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825956564] [2022-12-12 18:32:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825956564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:04,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:04,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673534367] [2022-12-12 18:32:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:04,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:32:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:32:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:32:04,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 18:32:04,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 858 transitions, 18212 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-12 18:32:04,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:04,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 18:32:04,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:08,594 INFO L130 PetriNetUnfolder]: 13971/23141 cut-off events. [2022-12-12 18:32:08,594 INFO L131 PetriNetUnfolder]: For 202946/207702 co-relation queries the response was YES. [2022-12-12 18:32:08,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227249 conditions, 23141 events. 13971/23141 cut-off events. For 202946/207702 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 173653 event pairs, 487 based on Foata normal form. 3097/22691 useless extension candidates. Maximal degree in co-relation 227207. Up to 17784 conditions per place. [2022-12-12 18:32:08,801 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 473 selfloop transitions, 267 changer transitions 98/888 dead transitions. [2022-12-12 18:32:08,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 888 transitions, 20479 flow [2022-12-12 18:32:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:32:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:32:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2022-12-12 18:32:08,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-12 18:32:08,804 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2022-12-12 18:32:08,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 888 transitions, 20479 flow [2022-12-12 18:32:09,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 790 transitions, 18175 flow [2022-12-12 18:32:09,090 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 790 transitions, 18175 flow [2022-12-12 18:32:09,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-12 18:32:09,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:09,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:09,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:32:09,091 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2036484294, now seen corresponding path program 1 times [2022-12-12 18:32:09,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:09,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235232161] [2022-12-12 18:32:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:09,328 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-12 18:32:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:09,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235232161] [2022-12-12 18:32:09,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235232161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:09,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:09,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:32:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335297110] [2022-12-12 18:32:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:09,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:32:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:32:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:32:09,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 18:32:09,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 790 transitions, 18175 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-12 18:32:09,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:09,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 18:32:09,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:12,162 INFO L130 PetriNetUnfolder]: 10481/16489 cut-off events. [2022-12-12 18:32:12,163 INFO L131 PetriNetUnfolder]: For 183128/186883 co-relation queries the response was YES. [2022-12-12 18:32:12,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173877 conditions, 16489 events. 10481/16489 cut-off events. For 183128/186883 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 109333 event pairs, 123 based on Foata normal form. 2053/16039 useless extension candidates. Maximal degree in co-relation 173832. Up to 11925 conditions per place. [2022-12-12 18:32:12,252 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 190 selfloop transitions, 113 changer transitions 458/782 dead transitions. [2022-12-12 18:32:12,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 782 transitions, 19447 flow [2022-12-12 18:32:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2022-12-12 18:32:12,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38675213675213677 [2022-12-12 18:32:12,254 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2022-12-12 18:32:12,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 782 transitions, 19447 flow [2022-12-12 18:32:12,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 324 transitions, 7920 flow [2022-12-12 18:32:12,320 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 324 transitions, 7920 flow [2022-12-12 18:32:12,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-12 18:32:12,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:12,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:12,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:32:12,321 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1705357530, now seen corresponding path program 1 times [2022-12-12 18:32:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:12,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841246755] [2022-12-12 18:32:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:12,678 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-12 18:32:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:12,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841246755] [2022-12-12 18:32:12,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841246755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:12,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:12,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138555736] [2022-12-12 18:32:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:12,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:32:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:32:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:32:12,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 18:32:12,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 324 transitions, 7920 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-12 18:32:12,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:12,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 18:32:12,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:14,435 INFO L130 PetriNetUnfolder]: 8380/12951 cut-off events. [2022-12-12 18:32:14,435 INFO L131 PetriNetUnfolder]: For 125905/127359 co-relation queries the response was YES. [2022-12-12 18:32:14,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154092 conditions, 12951 events. 8380/12951 cut-off events. For 125905/127359 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 78362 event pairs, 125 based on Foata normal form. 182/10705 useless extension candidates. Maximal degree in co-relation 154044. Up to 10798 conditions per place. [2022-12-12 18:32:14,519 INFO L137 encePairwiseOnDemand]: 72/78 looper letters, 169 selfloop transitions, 7 changer transitions 299/496 dead transitions. [2022-12-12 18:32:14,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 496 transitions, 13276 flow [2022-12-12 18:32:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-12 18:32:14,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3247863247863248 [2022-12-12 18:32:14,522 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2022-12-12 18:32:14,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 496 transitions, 13276 flow [2022-12-12 18:32:14,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 197 transitions, 5039 flow [2022-12-12 18:32:14,769 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 197 transitions, 5039 flow [2022-12-12 18:32:14,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-12 18:32:14,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:14,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:14,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:32:14,770 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash 646240702, now seen corresponding path program 2 times [2022-12-12 18:32:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:14,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513954976] [2022-12-12 18:32:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:15,595 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-12 18:32:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:15,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513954976] [2022-12-12 18:32:15,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513954976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:15,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:15,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222893459] [2022-12-12 18:32:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:15,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:32:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:32:15,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:32:15,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:32:15,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 197 transitions, 5039 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-12 18:32:15,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:15,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:32:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:16,488 INFO L130 PetriNetUnfolder]: 4906/8049 cut-off events. [2022-12-12 18:32:16,488 INFO L131 PetriNetUnfolder]: For 66465/67062 co-relation queries the response was YES. [2022-12-12 18:32:16,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102246 conditions, 8049 events. 4906/8049 cut-off events. For 66465/67062 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 51725 event pairs, 4 based on Foata normal form. 129/6396 useless extension candidates. Maximal degree in co-relation 102195. Up to 7449 conditions per place. [2022-12-12 18:32:16,537 INFO L137 encePairwiseOnDemand]: 72/78 looper letters, 182 selfloop transitions, 18 changer transitions 21/247 dead transitions. [2022-12-12 18:32:16,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 247 transitions, 6881 flow [2022-12-12 18:32:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:32:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:32:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-12 18:32:16,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2022-12-12 18:32:16,539 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 3 predicate places. [2022-12-12 18:32:16,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 247 transitions, 6881 flow [2022-12-12 18:32:16,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 226 transitions, 6251 flow [2022-12-12 18:32:16,576 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 226 transitions, 6251 flow [2022-12-12 18:32:16,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-12 18:32:16,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:16,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:16,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:32:16,577 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1887808634, now seen corresponding path program 3 times [2022-12-12 18:32:16,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:16,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706920268] [2022-12-12 18:32:16,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:16,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:17,796 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-12 18:32:17,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:17,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706920268] [2022-12-12 18:32:17,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706920268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:17,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:17,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 18:32:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527775572] [2022-12-12 18:32:17,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:17,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 18:32:17,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:17,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 18:32:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-12 18:32:17,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:32:17,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 226 transitions, 6251 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-12 18:32:17,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:17,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:32:17,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:18,953 INFO L130 PetriNetUnfolder]: 5819/9578 cut-off events. [2022-12-12 18:32:18,953 INFO L131 PetriNetUnfolder]: For 82136/82766 co-relation queries the response was YES. [2022-12-12 18:32:18,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127062 conditions, 9578 events. 5819/9578 cut-off events. For 82136/82766 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 64273 event pairs, 4 based on Foata normal form. 189/7592 useless extension candidates. Maximal degree in co-relation 127008. Up to 8969 conditions per place. [2022-12-12 18:32:19,002 INFO L137 encePairwiseOnDemand]: 72/78 looper letters, 185 selfloop transitions, 41 changer transitions 35/287 dead transitions. [2022-12-12 18:32:19,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 287 transitions, 8591 flow [2022-12-12 18:32:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2022-12-12 18:32:19,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 18:32:19,005 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2022-12-12 18:32:19,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 287 transitions, 8591 flow [2022-12-12 18:32:19,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 252 transitions, 7468 flow [2022-12-12 18:32:19,041 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 252 transitions, 7468 flow [2022-12-12 18:32:19,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-12 18:32:19,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:19,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:19,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:32:19,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash -941607988, now seen corresponding path program 1 times [2022-12-12 18:32:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097206871] [2022-12-12 18:32:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:20,035 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-12 18:32:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:20,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097206871] [2022-12-12 18:32:20,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097206871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:20,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:20,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 18:32:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108611314] [2022-12-12 18:32:20,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:20,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 18:32:20,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 18:32:20,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 18:32:20,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:32:20,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 252 transitions, 7468 flow. Second operand has 8 states, 8 states have (on average 18.625) internal successors, (149), 8 states have internal predecessors, (149), 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-12 18:32:20,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:20,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:32:20,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:21,593 INFO L130 PetriNetUnfolder]: 6515/10722 cut-off events. [2022-12-12 18:32:21,593 INFO L131 PetriNetUnfolder]: For 107333/108350 co-relation queries the response was YES. [2022-12-12 18:32:21,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148774 conditions, 10722 events. 6515/10722 cut-off events. For 107333/108350 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 74690 event pairs, 2 based on Foata normal form. 290/8474 useless extension candidates. Maximal degree in co-relation 148717. Up to 10177 conditions per place. [2022-12-12 18:32:21,656 INFO L137 encePairwiseOnDemand]: 72/78 looper letters, 232 selfloop transitions, 31 changer transitions 22/311 dead transitions. [2022-12-12 18:32:21,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 311 transitions, 9920 flow [2022-12-12 18:32:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:32:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:32:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-12-12 18:32:21,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2022-12-12 18:32:21,658 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 12 predicate places. [2022-12-12 18:32:21,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 311 transitions, 9920 flow [2022-12-12 18:32:21,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 289 transitions, 9172 flow [2022-12-12 18:32:21,702 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 289 transitions, 9172 flow [2022-12-12 18:32:21,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.625) internal successors, (149), 8 states have internal predecessors, (149), 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-12 18:32:21,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:21,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 18:32:21,702 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 121135526, now seen corresponding path program 4 times [2022-12-12 18:32:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915381476] [2022-12-12 18:32:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:23,297 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-12 18:32:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:23,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915381476] [2022-12-12 18:32:23,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915381476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:23,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:23,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 18:32:23,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768400154] [2022-12-12 18:32:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:23,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 18:32:23,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 18:32:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-12 18:32:23,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 18:32:23,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 289 transitions, 9172 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-12 18:32:23,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:23,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 18:32:23,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:25,314 INFO L130 PetriNetUnfolder]: 7737/13041 cut-off events. [2022-12-12 18:32:25,314 INFO L131 PetriNetUnfolder]: For 120073/120952 co-relation queries the response was YES. [2022-12-12 18:32:25,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188759 conditions, 13041 events. 7737/13041 cut-off events. For 120073/120952 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 96932 event pairs, 11 based on Foata normal form. 301/10219 useless extension candidates. Maximal degree in co-relation 188699. Up to 12491 conditions per place. [2022-12-12 18:32:25,386 INFO L137 encePairwiseOnDemand]: 71/78 looper letters, 270 selfloop transitions, 37 changer transitions 172/503 dead transitions. [2022-12-12 18:32:25,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 503 transitions, 17390 flow [2022-12-12 18:32:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:32:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:32:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2022-12-12 18:32:25,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-12 18:32:25,388 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 19 predicate places. [2022-12-12 18:32:25,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 503 transitions, 17390 flow [2022-12-12 18:32:25,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 331 transitions, 11254 flow [2022-12-12 18:32:25,438 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 331 transitions, 11254 flow [2022-12-12 18:32:25,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-12 18:32:25,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:25,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:25,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 18:32:25,439 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:25,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1244321692, now seen corresponding path program 5 times [2022-12-12 18:32:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:25,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818936288] [2022-12-12 18:32:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:32:25,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:32:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:32:25,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:32:25,582 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:32:25,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 18:32:25,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 18:32:25,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 18:32:25,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 18:32:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 18:32:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 18:32:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 18:32:25,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 18:32:25,590 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:25,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:32:25,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:32:25,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:32:25 BasicIcfg [2022-12-12 18:32:25,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:32:25,702 INFO L158 Benchmark]: Toolchain (without parser) took 87811.43ms. Allocated memory was 184.5MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 159.5MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 592.2MB. Max. memory is 8.0GB. [2022-12-12 18:32:25,702 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:32:25,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.62ms. Allocated memory is still 184.5MB. Free memory was 158.9MB in the beginning and 130.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 18:32:25,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.56ms. Allocated memory is still 184.5MB. Free memory was 130.6MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:32:25,703 INFO L158 Benchmark]: Boogie Preprocessor took 50.44ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 125.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 18:32:25,703 INFO L158 Benchmark]: RCFGBuilder took 773.94ms. Allocated memory is still 184.5MB. Free memory was 125.4MB in the beginning and 87.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-12 18:32:25,703 INFO L158 Benchmark]: TraceAbstraction took 86363.08ms. Allocated memory was 184.5MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 86.6MB in the beginning and 7.0GB in the end (delta: -7.0GB). Peak memory consumption was 518.8MB. Max. memory is 8.0GB. [2022-12-12 18:32:25,704 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.12ms. Allocated memory is still 184.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 548.62ms. Allocated memory is still 184.5MB. Free memory was 158.9MB in the beginning and 130.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.56ms. Allocated memory is still 184.5MB. Free memory was 130.6MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.44ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 125.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 773.94ms. Allocated memory is still 184.5MB. Free memory was 125.4MB in the beginning and 87.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 86363.08ms. Allocated memory was 184.5MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 86.6MB in the beginning and 7.0GB in the end (delta: -7.0GB). Peak memory consumption was 518.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.6s, 140 PlacesBefore, 91 PlacesAfterwards, 129 TransitionsBefore, 78 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 5698, independent unconditional: 0, dependent: 219, dependent conditional: 219, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 0, independent unconditional: 5698, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 0, independent unconditional: 5698, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 0, independent unconditional: 5698, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3125, independent: 3047, independent conditional: 0, independent unconditional: 3047, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3125, independent: 3023, independent conditional: 0, independent unconditional: 3023, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 680, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5917, independent: 2651, independent conditional: 0, independent unconditional: 2651, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 3125, unknown conditional: 0, unknown unconditional: 3125] , Statistics on independence cache: Total cache size (in pairs): 5223, Positive cache size: 5145, Positive conditional cache size: 0, Positive unconditional cache size: 5145, Negative cache size: 78, Negative conditional cache size: 0, Negative unconditional cache size: 78, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-1, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=0, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=2, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 865]: 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: 863]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 2.6s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 86.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 63.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 775 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 775 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2029 IncrementalHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 45 mSDtfsCounter, 2029 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18212occurred in iteration=10, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 37827 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 4069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:32:25,730 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...