/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:56:05,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:56:05,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:56:05,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:56:05,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:56:05,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:56:05,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:56:05,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:56:05,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:56:05,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:56:05,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:56:05,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:56:05,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:56:05,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:56:05,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:56:05,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:56:05,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:56:05,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:56:05,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:56:05,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:56:05,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:56:05,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:56:05,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:56:05,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:56:05,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:56:05,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:56:05,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:56:05,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:56:05,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:56:05,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:56:05,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:56:05,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:56:05,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:56:05,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:56:05,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:56:05,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:56:05,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:56:05,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:56:05,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:56:05,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:56:05,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:56:05,279 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:56:05,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:56:05,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:56:05,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:56:05,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:56:05,306 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:56:05,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:56:05,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:56:05,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:56:05,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:56:05,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:56:05,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:56:05,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:56:05,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:56:05,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:56:05,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:56:05,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:56:05,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:56:05,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:56:05,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:56:05,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:56:05,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:56:05,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:56:05,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:56:05,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:56:05,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:56:05,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:56:05,600 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:56:05,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-12-13 11:56:06,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:56:06,866 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:56:06,866 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-12-13 11:56:06,887 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f044013d/5adf9cb3dcfb4ac8ade558529e0b854f/FLAGc65d9c8d6 [2022-12-13 11:56:06,899 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f044013d/5adf9cb3dcfb4ac8ade558529e0b854f [2022-12-13 11:56:06,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:56:06,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:56:06,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:56:06,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:56:06,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:56:06,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:56:06" (1/1) ... [2022-12-13 11:56:06,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee25bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:06, skipping insertion in model container [2022-12-13 11:56:06,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:56:06" (1/1) ... [2022-12-13 11:56:06,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:56:06,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:56:07,080 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-13 11:56:07,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:56:07,238 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:56:07,246 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:07,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:07,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:56:07,324 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:56:07,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07 WrapperNode [2022-12-13 11:56:07,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:56:07,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:56:07,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:56:07,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:56:07,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,376 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 11:56:07,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:56:07,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:56:07,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:56:07,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:56:07,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:56:07,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:56:07,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:56:07,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:56:07,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (1/1) ... [2022-12-13 11:56:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:56:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:56:07,425 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-13 11:56:07,453 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-13 11:56:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:56:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:56:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:56:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:56:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:56:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:56:07,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:56:07,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:56:07,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:56:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:56:07,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:56:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:56:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:56:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:56:07,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:56:07,481 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:56:07,606 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:56:07,608 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:56:07,826 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:56:07,910 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:56:07,910 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:56:07,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:56:07 BoogieIcfgContainer [2022-12-13 11:56:07,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:56:07,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:56:07,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:56:07,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:56:07,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:56:06" (1/3) ... [2022-12-13 11:56:07,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:56:07, skipping insertion in model container [2022-12-13 11:56:07,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:07" (2/3) ... [2022-12-13 11:56:07,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:56:07, skipping insertion in model container [2022-12-13 11:56:07,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:56:07" (3/3) ... [2022-12-13 11:56:07,917 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2022-12-13 11:56:07,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:56:07,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:56:07,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:56:07,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:56:07,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 11:56:08,021 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 11:56:08,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:08,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 11:56:08,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 11:56:08,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:08,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:08,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:08,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:08,067 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 11:56:08,067 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:08,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 11:56:08,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:08,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 1676 [2022-12-13 11:56:11,327 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 11:56:11,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:56:11,350 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=REPEATED_LIPTON_PN, 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;@4713fc27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:56:11,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:56:11,365 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-13 11:56:11,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:11,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:11,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:11,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1687281307, now seen corresponding path program 1 times [2022-12-13 11:56:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:11,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886934717] [2022-12-13 11:56:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:11,670 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-13 11:56:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:11,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886934717] [2022-12-13 11:56:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886934717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:11,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:11,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:56:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118451625] [2022-12-13 11:56:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:11,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:11,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:11,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:11,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-13 11:56:11,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:11,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:11,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-13 11:56:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:12,419 INFO L130 PetriNetUnfolder]: 5844/9448 cut-off events. [2022-12-13 11:56:12,420 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 11:56:12,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17896 conditions, 9448 events. 5844/9448 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 68715 event pairs, 824 based on Foata normal form. 0/5702 useless extension candidates. Maximal degree in co-relation 17885. Up to 7021 conditions per place. [2022-12-13 11:56:12,440 INFO L137 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 42/82 dead transitions. [2022-12-13 11:56:12,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 317 flow [2022-12-13 11:56:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-13 11:56:12,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-13 11:56:12,451 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 3 states and 107 transitions. [2022-12-13 11:56:12,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 82 transitions, 317 flow [2022-12-13 11:56:12,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 82 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:56:12,456 INFO L231 Difference]: Finished difference. Result has 60 places, 30 transitions, 70 flow [2022-12-13 11:56:12,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=60, PETRI_TRANSITIONS=30} [2022-12-13 11:56:12,460 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2022-12-13 11:56:12,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:12,461 INFO L89 Accepts]: Start accepts. Operand has 60 places, 30 transitions, 70 flow [2022-12-13 11:56:12,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:12,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:12,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 30 transitions, 70 flow [2022-12-13 11:56:12,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 11:56:12,467 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 11:56:12,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:12,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 62 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:56:12,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 11:56:12,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 11:56:12,556 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:12,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 11:56:12,558 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 11:56:12,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:12,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:12,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:12,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:56:12,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2020327964, now seen corresponding path program 1 times [2022-12-13 11:56:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:12,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254763651] [2022-12-13 11:56:12,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:12,668 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-13 11:56:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:12,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254763651] [2022-12-13 11:56:12,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254763651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:12,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:12,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:56:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740200807] [2022-12-13 11:56:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:12,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:12,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 11:56:12,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 11:56:12,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:12,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 11:56:12,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:12,850 INFO L130 PetriNetUnfolder]: 1436/2261 cut-off events. [2022-12-13 11:56:12,851 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-12-13 11:56:12,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 2261 events. 1436/2261 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12082 event pairs, 363 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 4552. Up to 2017 conditions per place. [2022-12-13 11:56:12,858 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 31 selfloop transitions, 3 changer transitions 2/44 dead transitions. [2022-12-13 11:56:12,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 176 flow [2022-12-13 11:56:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 11:56:12,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 11:56:12,860 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 61 transitions. [2022-12-13 11:56:12,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 176 flow [2022-12-13 11:56:12,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:12,863 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 83 flow [2022-12-13 11:56:12,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-13 11:56:12,863 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -23 predicate places. [2022-12-13 11:56:12,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:12,864 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 83 flow [2022-12-13 11:56:12,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:12,864 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:12,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 83 flow [2022-12-13 11:56:12,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 83 flow [2022-12-13 11:56:12,870 INFO L130 PetriNetUnfolder]: 3/43 cut-off events. [2022-12-13 11:56:12,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:12,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 43 events. 3/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2022-12-13 11:56:12,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 83 flow [2022-12-13 11:56:12,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-13 11:56:12,886 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:12,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 11:56:12,888 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 83 flow [2022-12-13 11:56:12,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 11:56:12,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:12,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:12,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:56:12,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1794344074, now seen corresponding path program 1 times [2022-12-13 11:56:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:12,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878179799] [2022-12-13 11:56:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:13,014 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-13 11:56:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878179799] [2022-12-13 11:56:13,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878179799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:13,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772566624] [2022-12-13 11:56:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:13,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 11:56:13,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 11:56:13,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:13,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 11:56:13,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:13,243 INFO L130 PetriNetUnfolder]: 1861/2939 cut-off events. [2022-12-13 11:56:13,243 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-13 11:56:13,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6327 conditions, 2939 events. 1861/2939 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15964 event pairs, 499 based on Foata normal form. 210/2171 useless extension candidates. Maximal degree in co-relation 6316. Up to 2293 conditions per place. [2022-12-13 11:56:13,253 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 49 selfloop transitions, 17 changer transitions 8/81 dead transitions. [2022-12-13 11:56:13,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 81 transitions, 350 flow [2022-12-13 11:56:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:56:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:56:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 11:56:13,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7034482758620689 [2022-12-13 11:56:13,255 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 83 flow. Second operand 5 states and 102 transitions. [2022-12-13 11:56:13,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 81 transitions, 350 flow [2022-12-13 11:56:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 81 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:13,256 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 212 flow [2022-12-13 11:56:13,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2022-12-13 11:56:13,257 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -18 predicate places. [2022-12-13 11:56:13,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:13,257 INFO L89 Accepts]: Start accepts. Operand has 45 places, 47 transitions, 212 flow [2022-12-13 11:56:13,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:13,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:13,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 212 flow [2022-12-13 11:56:13,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 212 flow [2022-12-13 11:56:13,298 INFO L130 PetriNetUnfolder]: 571/996 cut-off events. [2022-12-13 11:56:13,298 INFO L131 PetriNetUnfolder]: For 229/231 co-relation queries the response was YES. [2022-12-13 11:56:13,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 996 events. 571/996 cut-off events. For 229/231 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 6808 event pairs, 312 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 2726. Up to 755 conditions per place. [2022-12-13 11:56:13,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 212 flow [2022-12-13 11:56:13,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 11:56:13,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L828-3-->L832: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (mod v_~main$tmp_guard0~0_28 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [319] L806-->L809: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:56:13,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L828-3-->L832: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (mod v_~main$tmp_guard0~0_28 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [394] L806-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-13 11:56:13,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L828-3-->L832: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (mod v_~main$tmp_guard0~0_28 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [311] L775-->L780: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:56:13,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L828-3-->L832: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (mod v_~main$tmp_guard0~0_28 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [395] L806-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res#1.base_9| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-13 11:56:13,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L828-3-->L832: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (mod v_~main$tmp_guard0~0_28 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [429] L775-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_135 (+ v_~__unbuffered_cnt~0_136 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 11:56:13,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L828-3-->L832: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (mod v_~main$tmp_guard0~0_28 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [430] L775-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_139 (+ v_~__unbuffered_cnt~0_140 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 11:56:13,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:56:13,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-13 11:56:13,458 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 230 flow [2022-12-13 11:56:13,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 11:56:13,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:13,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:13,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:56:13,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1424385799, now seen corresponding path program 1 times [2022-12-13 11:56:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:13,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656672760] [2022-12-13 11:56:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:13,563 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-13 11:56:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:13,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656672760] [2022-12-13 11:56:13,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656672760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:13,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:13,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145760798] [2022-12-13 11:56:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:13,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:13,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:13,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-13 11:56:13,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:13,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:13,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-13 11:56:13,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:13,949 INFO L130 PetriNetUnfolder]: 2925/4775 cut-off events. [2022-12-13 11:56:13,950 INFO L131 PetriNetUnfolder]: For 2932/3212 co-relation queries the response was YES. [2022-12-13 11:56:13,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15672 conditions, 4775 events. 2925/4775 cut-off events. For 2932/3212 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 29843 event pairs, 930 based on Foata normal form. 169/3969 useless extension candidates. Maximal degree in co-relation 15657. Up to 2843 conditions per place. [2022-12-13 11:56:13,968 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 47 selfloop transitions, 7 changer transitions 12/76 dead transitions. [2022-12-13 11:56:13,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 526 flow [2022-12-13 11:56:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 11:56:13,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2022-12-13 11:56:13,969 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 230 flow. Second operand 3 states and 73 transitions. [2022-12-13 11:56:13,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 526 flow [2022-12-13 11:56:13,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 486 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:13,977 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 216 flow [2022-12-13 11:56:13,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2022-12-13 11:56:13,978 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -16 predicate places. [2022-12-13 11:56:13,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:13,978 INFO L89 Accepts]: Start accepts. Operand has 47 places, 45 transitions, 216 flow [2022-12-13 11:56:13,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:13,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:13,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 45 transitions, 216 flow [2022-12-13 11:56:13,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 216 flow [2022-12-13 11:56:14,065 INFO L130 PetriNetUnfolder]: 1080/1867 cut-off events. [2022-12-13 11:56:14,065 INFO L131 PetriNetUnfolder]: For 562/735 co-relation queries the response was YES. [2022-12-13 11:56:14,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5345 conditions, 1867 events. 1080/1867 cut-off events. For 562/735 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 12878 event pairs, 511 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 5330. Up to 1510 conditions per place. [2022-12-13 11:56:14,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 216 flow [2022-12-13 11:56:14,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-13 11:56:14,078 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:14,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 11:56:14,078 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 216 flow [2022-12-13 11:56:14,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:14,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:14,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:14,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:56:14,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:14,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash 186011219, now seen corresponding path program 1 times [2022-12-13 11:56:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:14,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171991308] [2022-12-13 11:56:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:14,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:14,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171991308] [2022-12-13 11:56:14,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171991308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:14,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:14,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:56:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456663236] [2022-12-13 11:56:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:14,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:56:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:56:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:56:14,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 11:56:14,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 11:56:14,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:14,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 11:56:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:14,487 INFO L130 PetriNetUnfolder]: 1820/3202 cut-off events. [2022-12-13 11:56:14,487 INFO L131 PetriNetUnfolder]: For 2303/2344 co-relation queries the response was YES. [2022-12-13 11:56:14,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11247 conditions, 3202 events. 1820/3202 cut-off events. For 2303/2344 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 21254 event pairs, 184 based on Foata normal form. 338/2442 useless extension candidates. Maximal degree in co-relation 11229. Up to 1912 conditions per place. [2022-12-13 11:56:14,504 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 50 selfloop transitions, 26 changer transitions 24/109 dead transitions. [2022-12-13 11:56:14,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 109 transitions, 732 flow [2022-12-13 11:56:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:56:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:56:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-12-13 11:56:14,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2022-12-13 11:56:14,511 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 216 flow. Second operand 6 states and 124 transitions. [2022-12-13 11:56:14,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 109 transitions, 732 flow [2022-12-13 11:56:14,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 109 transitions, 700 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 11:56:14,527 INFO L231 Difference]: Finished difference. Result has 51 places, 61 transitions, 408 flow [2022-12-13 11:56:14,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=51, PETRI_TRANSITIONS=61} [2022-12-13 11:56:14,527 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -12 predicate places. [2022-12-13 11:56:14,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:14,528 INFO L89 Accepts]: Start accepts. Operand has 51 places, 61 transitions, 408 flow [2022-12-13 11:56:14,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:14,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:14,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 61 transitions, 408 flow [2022-12-13 11:56:14,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 61 transitions, 408 flow [2022-12-13 11:56:14,595 INFO L130 PetriNetUnfolder]: 630/1484 cut-off events. [2022-12-13 11:56:14,595 INFO L131 PetriNetUnfolder]: For 1224/1385 co-relation queries the response was YES. [2022-12-13 11:56:14,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6078 conditions, 1484 events. 630/1484 cut-off events. For 1224/1385 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 12354 event pairs, 128 based on Foata normal form. 3/804 useless extension candidates. Maximal degree in co-relation 6061. Up to 1165 conditions per place. [2022-12-13 11:56:14,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 61 transitions, 408 flow [2022-12-13 11:56:14,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-13 11:56:14,825 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:56:14,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-13 11:56:14,825 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 400 flow [2022-12-13 11:56:14,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 11:56:14,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:14,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:14,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:56:14,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 619408258, now seen corresponding path program 1 times [2022-12-13 11:56:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:14,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726364811] [2022-12-13 11:56:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:14,928 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-13 11:56:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726364811] [2022-12-13 11:56:14,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726364811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:14,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:14,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:56:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474265939] [2022-12-13 11:56:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:56:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:56:14,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:56:14,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 11:56:14,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-13 11:56:14,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:14,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 11:56:14,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:15,121 INFO L130 PetriNetUnfolder]: 884/1717 cut-off events. [2022-12-13 11:56:15,121 INFO L131 PetriNetUnfolder]: For 1689/1721 co-relation queries the response was YES. [2022-12-13 11:56:15,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7367 conditions, 1717 events. 884/1717 cut-off events. For 1689/1721 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11065 event pairs, 40 based on Foata normal form. 215/1335 useless extension candidates. Maximal degree in co-relation 7347. Up to 1066 conditions per place. [2022-12-13 11:56:15,128 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 38 selfloop transitions, 29 changer transitions 16/92 dead transitions. [2022-12-13 11:56:15,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 692 flow [2022-12-13 11:56:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:56:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:56:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-13 11:56:15,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 11:56:15,130 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 400 flow. Second operand 7 states and 116 transitions. [2022-12-13 11:56:15,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 692 flow [2022-12-13 11:56:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 628 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 11:56:15,145 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 372 flow [2022-12-13 11:56:15,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 11:56:15,146 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2022-12-13 11:56:15,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:15,146 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 372 flow [2022-12-13 11:56:15,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:15,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:15,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 372 flow [2022-12-13 11:56:15,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 372 flow [2022-12-13 11:56:15,180 INFO L130 PetriNetUnfolder]: 216/677 cut-off events. [2022-12-13 11:56:15,180 INFO L131 PetriNetUnfolder]: For 846/911 co-relation queries the response was YES. [2022-12-13 11:56:15,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3011 conditions, 677 events. 216/677 cut-off events. For 846/911 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 5281 event pairs, 2 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 2992. Up to 406 conditions per place. [2022-12-13 11:56:15,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 372 flow [2022-12-13 11:56:15,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 11:56:15,527 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:56:15,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-13 11:56:15,528 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 358 flow [2022-12-13 11:56:15,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-13 11:56:15,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:15,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:56:15,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash -702266536, now seen corresponding path program 1 times [2022-12-13 11:56:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:15,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33679044] [2022-12-13 11:56:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:15,670 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-13 11:56:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:15,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33679044] [2022-12-13 11:56:15,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33679044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:15,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:15,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010445423] [2022-12-13 11:56:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:15,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:15,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:15,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2022-12-13 11:56:15,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-13 11:56:15,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:15,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2022-12-13 11:56:15,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:15,853 INFO L130 PetriNetUnfolder]: 884/1622 cut-off events. [2022-12-13 11:56:15,853 INFO L131 PetriNetUnfolder]: For 3898/4006 co-relation queries the response was YES. [2022-12-13 11:56:15,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7493 conditions, 1622 events. 884/1622 cut-off events. For 3898/4006 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 9981 event pairs, 72 based on Foata normal form. 86/1315 useless extension candidates. Maximal degree in co-relation 7471. Up to 769 conditions per place. [2022-12-13 11:56:15,863 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 38 selfloop transitions, 1 changer transitions 40/94 dead transitions. [2022-12-13 11:56:15,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 94 transitions, 802 flow [2022-12-13 11:56:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 11:56:15,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 11:56:15,864 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 358 flow. Second operand 4 states and 74 transitions. [2022-12-13 11:56:15,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 94 transitions, 802 flow [2022-12-13 11:56:15,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 612 flow, removed 48 selfloop flow, removed 7 redundant places. [2022-12-13 11:56:15,891 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 247 flow [2022-12-13 11:56:15,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2022-12-13 11:56:15,892 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -14 predicate places. [2022-12-13 11:56:15,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:15,894 INFO L89 Accepts]: Start accepts. Operand has 49 places, 50 transitions, 247 flow [2022-12-13 11:56:15,895 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:15,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:15,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 50 transitions, 247 flow [2022-12-13 11:56:15,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 247 flow [2022-12-13 11:56:15,913 INFO L130 PetriNetUnfolder]: 192/416 cut-off events. [2022-12-13 11:56:15,914 INFO L131 PetriNetUnfolder]: For 446/462 co-relation queries the response was YES. [2022-12-13 11:56:15,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 416 events. 192/416 cut-off events. For 446/462 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2324 event pairs, 1 based on Foata normal form. 3/165 useless extension candidates. Maximal degree in co-relation 1135. Up to 190 conditions per place. [2022-12-13 11:56:15,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 50 transitions, 247 flow [2022-12-13 11:56:15,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 11:56:15,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:56:15,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 11:56:15,953 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 248 flow [2022-12-13 11:56:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-13 11:56:15,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:15,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:15,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:56:15,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash 320260128, now seen corresponding path program 1 times [2022-12-13 11:56:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:15,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417625420] [2022-12-13 11:56:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:15,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:16,104 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-13 11:56:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:16,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417625420] [2022-12-13 11:56:16,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417625420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:16,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:16,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196544571] [2022-12-13 11:56:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:16,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:16,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:16,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 11:56:16,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 11:56:16,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:16,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 11:56:16,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:16,201 INFO L130 PetriNetUnfolder]: 590/1096 cut-off events. [2022-12-13 11:56:16,201 INFO L131 PetriNetUnfolder]: For 1686/1732 co-relation queries the response was YES. [2022-12-13 11:56:16,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 1096 events. 590/1096 cut-off events. For 1686/1732 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6297 event pairs, 50 based on Foata normal form. 63/871 useless extension candidates. Maximal degree in co-relation 3715. Up to 571 conditions per place. [2022-12-13 11:56:16,204 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 36 selfloop transitions, 4 changer transitions 23/74 dead transitions. [2022-12-13 11:56:16,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 484 flow [2022-12-13 11:56:16,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 11:56:16,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 11:56:16,205 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 248 flow. Second operand 4 states and 66 transitions. [2022-12-13 11:56:16,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 484 flow [2022-12-13 11:56:16,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:16,212 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 222 flow [2022-12-13 11:56:16,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-13 11:56:16,213 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -14 predicate places. [2022-12-13 11:56:16,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:16,213 INFO L89 Accepts]: Start accepts. Operand has 49 places, 42 transitions, 222 flow [2022-12-13 11:56:16,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:16,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:16,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 42 transitions, 222 flow [2022-12-13 11:56:16,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 222 flow [2022-12-13 11:56:16,224 INFO L130 PetriNetUnfolder]: 81/185 cut-off events. [2022-12-13 11:56:16,224 INFO L131 PetriNetUnfolder]: For 349/358 co-relation queries the response was YES. [2022-12-13 11:56:16,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 185 events. 81/185 cut-off events. For 349/358 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 897 event pairs, 0 based on Foata normal form. 2/86 useless extension candidates. Maximal degree in co-relation 541. Up to 109 conditions per place. [2022-12-13 11:56:16,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 222 flow [2022-12-13 11:56:16,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 11:56:16,602 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:56:16,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 389 [2022-12-13 11:56:16,603 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 216 flow [2022-12-13 11:56:16,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 11:56:16,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:16,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:16,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:56:16,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1564763802, now seen corresponding path program 1 times [2022-12-13 11:56:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133204429] [2022-12-13 11:56:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:56:16,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:56:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:56:16,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:56:16,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:56:16,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:56:16,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:56:16,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:56:16,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:56:16,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:56:16,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:56:16,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:56:16,656 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:16,659 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:56:16,659 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:56:16,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:56:16 BasicIcfg [2022-12-13 11:56:16,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:56:16,692 INFO L158 Benchmark]: Toolchain (without parser) took 9790.54ms. Allocated memory was 205.5MB in the beginning and 626.0MB in the end (delta: 420.5MB). Free memory was 180.0MB in the beginning and 445.9MB in the end (delta: -265.9MB). Peak memory consumption was 155.9MB. Max. memory is 8.0GB. [2022-12-13 11:56:16,692 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory was 181.1MB in the beginning and 181.1MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:56:16,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.11ms. Allocated memory is still 205.5MB. Free memory was 180.0MB in the beginning and 154.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 11:56:16,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.43ms. Allocated memory is still 205.5MB. Free memory was 154.6MB in the beginning and 151.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:56:16,693 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 205.5MB. Free memory was 151.9MB in the beginning and 150.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:56:16,693 INFO L158 Benchmark]: RCFGBuilder took 509.06ms. Allocated memory is still 205.5MB. Free memory was 150.4MB in the beginning and 121.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 11:56:16,693 INFO L158 Benchmark]: TraceAbstraction took 8778.59ms. Allocated memory was 205.5MB in the beginning and 626.0MB in the end (delta: 420.5MB). Free memory was 119.4MB in the beginning and 445.9MB in the end (delta: -326.5MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. [2022-12-13 11:56:16,694 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.10ms. Allocated memory is still 205.5MB. Free memory was 181.1MB in the beginning and 181.1MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.11ms. Allocated memory is still 205.5MB. Free memory was 180.0MB in the beginning and 154.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.43ms. Allocated memory is still 205.5MB. Free memory was 154.6MB in the beginning and 151.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 205.5MB. Free memory was 151.9MB in the beginning and 150.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 509.06ms. Allocated memory is still 205.5MB. Free memory was 150.4MB in the beginning and 121.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 8778.59ms. Allocated memory was 205.5MB in the beginning and 626.0MB in the end (delta: 420.5MB). Free memory was 119.4MB in the beginning and 445.9MB in the end (delta: -326.5MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 111 PlacesBefore, 63 PlacesAfterwards, 103 TransitionsBefore, 54 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 3114, independent unconditional: 0, dependent: 107, dependent conditional: 107, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 0, independent unconditional: 3114, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 0, independent unconditional: 3114, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 0, independent unconditional: 3114, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1625, independent: 1591, independent conditional: 0, independent unconditional: 1591, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1625, independent: 1556, independent conditional: 0, independent unconditional: 1556, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3221, independent: 1523, independent conditional: 0, independent unconditional: 1523, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 1625, unknown conditional: 0, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 3658, Positive cache size: 3624, Positive conditional cache size: 0, Positive unconditional cache size: 3624, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268, independent: 236, independent conditional: 236, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 268, independent: 236, independent conditional: 9, independent unconditional: 227, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268, independent: 236, independent conditional: 9, independent unconditional: 227, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268, independent: 236, independent conditional: 9, independent unconditional: 227, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 195, independent: 174, independent conditional: 9, independent unconditional: 165, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 195, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 71, dependent conditional: 13, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 268, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 195, unknown conditional: 11, unknown unconditional: 184] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 174, Positive conditional cache size: 9, Positive unconditional cache size: 165, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 202, independent conditional: 202, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 223, independent: 202, independent conditional: 23, independent unconditional: 179, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 223, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 183, Positive conditional cache size: 9, Positive unconditional cache size: 174, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 744, independent: 684, independent conditional: 684, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 744, independent: 684, independent conditional: 252, independent unconditional: 432, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 744, independent: 684, independent conditional: 192, independent unconditional: 492, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 744, independent: 684, independent conditional: 192, independent unconditional: 492, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 744, independent: 677, independent conditional: 186, independent unconditional: 491, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 199, Positive conditional cache size: 15, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 114, independent conditional: 60, independent unconditional: 54, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 114, independent conditional: 36, independent unconditional: 78, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 114, independent conditional: 36, independent unconditional: 78, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, independent: 114, independent conditional: 36, independent unconditional: 78, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 199, Positive conditional cache size: 15, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 51 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, independent: 269, independent conditional: 269, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 299, independent: 269, independent conditional: 119, independent unconditional: 150, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 299, independent: 269, independent conditional: 103, independent unconditional: 166, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 299, independent: 269, independent conditional: 103, independent unconditional: 166, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, independent: 264, independent conditional: 98, independent unconditional: 166, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 204, Positive conditional cache size: 20, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 54 PlacesBefore, 51 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 397, independent: 367, independent conditional: 367, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 397, independent: 367, independent conditional: 197, independent unconditional: 170, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 397, independent: 367, independent conditional: 163, independent unconditional: 204, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 397, independent: 367, independent conditional: 163, independent unconditional: 204, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 397, independent: 354, independent conditional: 150, independent unconditional: 204, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 225, Positive conditional cache size: 33, Positive unconditional cache size: 192, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 47 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 174, independent conditional: 174, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 174, independent conditional: 104, independent unconditional: 70, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 174, independent conditional: 96, independent unconditional: 78, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 174, independent conditional: 96, independent unconditional: 78, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 174, independent conditional: 96, independent unconditional: 78, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 267, Positive conditional cache size: 35, Positive unconditional cache size: 232, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 47 PlacesBefore, 45 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 219, independent conditional: 219, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 219, independent conditional: 169, independent unconditional: 50, dependent: 38, dependent conditional: 28, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 219, independent conditional: 92, independent unconditional: 127, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 219, independent conditional: 92, independent unconditional: 127, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 215, independent conditional: 92, independent unconditional: 123, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 286, Positive conditional cache size: 38, Positive unconditional cache size: 248, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-1, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=1, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 698 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 5 mSDtfsCounter, 698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-13 11:56:16,716 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...