/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:38:02,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:38:02,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:38:02,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:38:02,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:38:02,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:38:02,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:38:02,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:38:02,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:38:02,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:38:02,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:38:02,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:38:02,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:38:02,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:38:02,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:38:02,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:38:02,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:38:02,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:38:02,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:38:02,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:38:02,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:38:02,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:38:02,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:38:02,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:38:02,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:38:02,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:38:02,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:38:02,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:38:02,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:38:02,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:38:02,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:38:02,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:38:02,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:38:02,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:38:02,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:38:02,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:38:02,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:38:02,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:38:02,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:38:02,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:38:02,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:38:02,500 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:38:02,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:38:02,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:38:02,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:38:02,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:38:02,527 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:38:02,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:38:02,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:38:02,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:38:02,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:38:02,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:38:02,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:38:02,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:38:02,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:02,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:38:02,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:38:02,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:38:02,531 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 09:38:02,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:38:02,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:38:02,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:38:02,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:38:02,818 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:38:02,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-13 09:38:03,779 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:38:03,964 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:38:03,965 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-13 09:38:03,981 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97769a92f/3b7c9f06b88f45c9b793a7dffe0b54e4/FLAG01be495e0 [2022-12-13 09:38:03,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97769a92f/3b7c9f06b88f45c9b793a7dffe0b54e4 [2022-12-13 09:38:03,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:38:03,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:38:03,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:03,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:38:03,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:38:03,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:03" (1/1) ... [2022-12-13 09:38:03,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a26c6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:03, skipping insertion in model container [2022-12-13 09:38:03,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:03" (1/1) ... [2022-12-13 09:38:04,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:38:04,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:38:04,136 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 09:38:04,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:04,325 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:38:04,335 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 09:38:04,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:04,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:04,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:04,415 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:38:04,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04 WrapperNode [2022-12-13 09:38:04,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:04,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:04,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:38:04,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:38:04,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,462 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-13 09:38:04,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:04,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:38:04,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:38:04,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:38:04,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:38:04,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:38:04,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:38:04,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:38:04,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (1/1) ... [2022-12-13 09:38:04,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:38:04,554 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 09:38:04,583 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 09:38:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:38:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:38:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:38:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:38:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:38:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:38:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:38:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:38:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:38:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:38:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:38:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:38:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:38:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:38:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:38:04,587 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 09:38:04,737 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:38:04,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:38:04,915 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:38:05,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:38:05,016 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:38:05,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:05 BoogieIcfgContainer [2022-12-13 09:38:05,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:38:05,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:38:05,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:38:05,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:38:05,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:38:03" (1/3) ... [2022-12-13 09:38:05,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae1875a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:05, skipping insertion in model container [2022-12-13 09:38:05,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:04" (2/3) ... [2022-12-13 09:38:05,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae1875a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:05, skipping insertion in model container [2022-12-13 09:38:05,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:05" (3/3) ... [2022-12-13 09:38:05,024 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-12-13 09:38:05,037 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:38:05,037 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:38:05,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:38:05,076 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:38:05,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-13 09:38:05,155 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-13 09:38:05,156 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:05,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:38:05,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-13 09:38:05,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-13 09:38:05,165 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:05,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-13 09:38:05,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2022-12-13 09:38:05,231 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-13 09:38:05,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:05,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:38:05,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-13 09:38:05,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-13 09:38:12,348 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 09:38:12,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:38:12,364 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;@4e305390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:38:12,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:38:12,367 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:38:12,368 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:12,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:12,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:12,368 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 09:38:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash 810967509, now seen corresponding path program 1 times [2022-12-13 09:38:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560942038] [2022-12-13 09:38:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:12,725 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 09:38:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:12,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560942038] [2022-12-13 09:38:12,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560942038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:12,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:12,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:38:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654499156] [2022-12-13 09:38:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:12,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:12,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-13 09:38:12,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 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 09:38:12,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:12,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-13 09:38:12,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:13,709 INFO L130 PetriNetUnfolder]: 6079/9807 cut-off events. [2022-12-13 09:38:13,710 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 09:38:13,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18590 conditions, 9807 events. 6079/9807 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 73508 event pairs, 855 based on Foata normal form. 0/5892 useless extension candidates. Maximal degree in co-relation 18579. Up to 7305 conditions per place. [2022-12-13 09:38:13,734 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-13 09:38:13,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-13 09:38:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-13 09:38:13,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-13 09:38:13,743 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 117 flow. Second operand 3 states and 107 transitions. [2022-12-13 09:38:13,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 325 flow [2022-12-13 09:38:13,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:13,748 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 70 flow [2022-12-13 09:38:13,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2022-12-13 09:38:13,752 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 09:38:13,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:13,752 INFO L89 Accepts]: Start accepts. Operand has 61 places, 30 transitions, 70 flow [2022-12-13 09:38:13,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:13,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:13,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 30 transitions, 70 flow [2022-12-13 09:38:13,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 09:38:13,758 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 09:38:13,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:13,758 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 63 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:38:13,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 09:38:13,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 09:38:13,808 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:13,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 09:38:13,810 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 09:38:13,810 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 09:38:13,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:13,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:13,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:38:13,810 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 09:38:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1950745454, now seen corresponding path program 1 times [2022-12-13 09:38:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:13,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62720367] [2022-12-13 09:38:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:14,374 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 09:38:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:14,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62720367] [2022-12-13 09:38:14,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62720367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:14,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:14,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299533344] [2022-12-13 09:38:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:14,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 09:38:14,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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 09:38:14,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:14,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 09:38:14,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:14,697 INFO L130 PetriNetUnfolder]: 2543/4051 cut-off events. [2022-12-13 09:38:14,698 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-13 09:38:14,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8135 conditions, 4051 events. 2543/4051 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23559 event pairs, 209 based on Foata normal form. 130/3475 useless extension candidates. Maximal degree in co-relation 8125. Up to 2497 conditions per place. [2022-12-13 09:38:14,715 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 44 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2022-12-13 09:38:14,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 254 flow [2022-12-13 09:38:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 09:38:14,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 09:38:14,742 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 4 states and 85 transitions. [2022-12-13 09:38:14,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 254 flow [2022-12-13 09:38:14,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:14,743 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 150 flow [2022-12-13 09:38:14,743 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2022-12-13 09:38:14,744 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -21 predicate places. [2022-12-13 09:38:14,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:14,744 INFO L89 Accepts]: Start accepts. Operand has 43 places, 40 transitions, 150 flow [2022-12-13 09:38:14,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:14,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:14,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 40 transitions, 150 flow [2022-12-13 09:38:14,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 150 flow [2022-12-13 09:38:14,773 INFO L130 PetriNetUnfolder]: 188/510 cut-off events. [2022-12-13 09:38:14,773 INFO L131 PetriNetUnfolder]: For 72/77 co-relation queries the response was YES. [2022-12-13 09:38:14,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 510 events. 188/510 cut-off events. For 72/77 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3377 event pairs, 75 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 1002. Up to 246 conditions per place. [2022-12-13 09:38:14,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 150 flow [2022-12-13 09:38:14,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-13 09:38:14,786 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:14,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 09:38:14,787 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 150 flow [2022-12-13 09:38:14,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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 09:38:14,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:14,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:14,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:38:14,787 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 09:38:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 343564328, now seen corresponding path program 1 times [2022-12-13 09:38:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:14,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258658583] [2022-12-13 09:38:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:14,898 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 09:38:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258658583] [2022-12-13 09:38:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258658583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:14,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:14,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:38:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529178027] [2022-12-13 09:38:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:14,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:14,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 09:38:14,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 150 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 09:38:14,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:14,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 09:38:14,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:15,165 INFO L130 PetriNetUnfolder]: 1920/3119 cut-off events. [2022-12-13 09:38:15,165 INFO L131 PetriNetUnfolder]: For 1633/1641 co-relation queries the response was YES. [2022-12-13 09:38:15,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 3119 events. 1920/3119 cut-off events. For 1633/1641 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17881 event pairs, 824 based on Foata normal form. 11/2548 useless extension candidates. Maximal degree in co-relation 8186. Up to 2731 conditions per place. [2022-12-13 09:38:15,180 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 39 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2022-12-13 09:38:15,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 286 flow [2022-12-13 09:38:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 09:38:15,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-13 09:38:15,182 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 150 flow. Second operand 3 states and 62 transitions. [2022-12-13 09:38:15,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 286 flow [2022-12-13 09:38:15,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:15,184 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 184 flow [2022-12-13 09:38:15,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2022-12-13 09:38:15,185 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -18 predicate places. [2022-12-13 09:38:15,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:15,185 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 184 flow [2022-12-13 09:38:15,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:15,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:15,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 184 flow [2022-12-13 09:38:15,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 43 transitions, 184 flow [2022-12-13 09:38:15,217 INFO L130 PetriNetUnfolder]: 177/503 cut-off events. [2022-12-13 09:38:15,217 INFO L131 PetriNetUnfolder]: For 171/175 co-relation queries the response was YES. [2022-12-13 09:38:15,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 503 events. 177/503 cut-off events. For 171/175 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3382 event pairs, 68 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1062. Up to 229 conditions per place. [2022-12-13 09:38:15,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 43 transitions, 184 flow [2022-12-13 09:38:15,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 686 [2022-12-13 09:38:15,226 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:15,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 09:38:15,227 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 184 flow [2022-12-13 09:38:15,227 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 09:38:15,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:15,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:15,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:38:15,228 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 09:38:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2062824500, now seen corresponding path program 1 times [2022-12-13 09:38:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33594085] [2022-12-13 09:38:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:15,589 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 09:38:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:15,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33594085] [2022-12-13 09:38:15,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33594085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:15,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:15,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447088279] [2022-12-13 09:38:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:15,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 09:38:15,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 09:38:15,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:15,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 09:38:15,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:15,961 INFO L130 PetriNetUnfolder]: 3172/5133 cut-off events. [2022-12-13 09:38:15,962 INFO L131 PetriNetUnfolder]: For 3163/3163 co-relation queries the response was YES. [2022-12-13 09:38:15,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 5133 events. 3172/5133 cut-off events. For 3163/3163 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31173 event pairs, 833 based on Foata normal form. 108/4264 useless extension candidates. Maximal degree in co-relation 13731. Up to 2409 conditions per place. [2022-12-13 09:38:15,981 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2022-12-13 09:38:15,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 469 flow [2022-12-13 09:38:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 09:38:15,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 09:38:15,982 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 184 flow. Second operand 4 states and 87 transitions. [2022-12-13 09:38:15,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 469 flow [2022-12-13 09:38:15,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:38:15,985 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 356 flow [2022-12-13 09:38:15,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2022-12-13 09:38:15,986 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -13 predicate places. [2022-12-13 09:38:15,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:15,986 INFO L89 Accepts]: Start accepts. Operand has 51 places, 55 transitions, 356 flow [2022-12-13 09:38:15,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:15,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:15,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 55 transitions, 356 flow [2022-12-13 09:38:15,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 55 transitions, 356 flow [2022-12-13 09:38:16,023 INFO L130 PetriNetUnfolder]: 210/628 cut-off events. [2022-12-13 09:38:16,024 INFO L131 PetriNetUnfolder]: For 665/699 co-relation queries the response was YES. [2022-12-13 09:38:16,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 628 events. 210/628 cut-off events. For 665/699 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4532 event pairs, 74 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 1708. Up to 270 conditions per place. [2022-12-13 09:38:16,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 55 transitions, 356 flow [2022-12-13 09:38:16,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 09:38:16,040 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:16,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 09:38:16,041 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 356 flow [2022-12-13 09:38:16,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 09:38:16,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:16,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:16,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:38:16,041 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 09:38:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2062851408, now seen corresponding path program 1 times [2022-12-13 09:38:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417679324] [2022-12-13 09:38:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:16,246 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 09:38:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:16,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417679324] [2022-12-13 09:38:16,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417679324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:16,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:16,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450509505] [2022-12-13 09:38:16,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:16,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:16,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:16,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:16,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 09:38:16,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 09:38:16,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:16,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 09:38:16,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:16,599 INFO L130 PetriNetUnfolder]: 2772/4610 cut-off events. [2022-12-13 09:38:16,600 INFO L131 PetriNetUnfolder]: For 5714/5722 co-relation queries the response was YES. [2022-12-13 09:38:16,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14426 conditions, 4610 events. 2772/4610 cut-off events. For 5714/5722 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 28891 event pairs, 793 based on Foata normal form. 10/3695 useless extension candidates. Maximal degree in co-relation 14406. Up to 3897 conditions per place. [2022-12-13 09:38:16,619 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 49 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-13 09:38:16,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 556 flow [2022-12-13 09:38:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 09:38:16,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2022-12-13 09:38:16,621 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 356 flow. Second operand 3 states and 59 transitions. [2022-12-13 09:38:16,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 556 flow [2022-12-13 09:38:16,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:16,629 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 393 flow [2022-12-13 09:38:16,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2022-12-13 09:38:16,629 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2022-12-13 09:38:16,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:16,629 INFO L89 Accepts]: Start accepts. Operand has 54 places, 58 transitions, 393 flow [2022-12-13 09:38:16,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:16,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:16,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 58 transitions, 393 flow [2022-12-13 09:38:16,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 58 transitions, 393 flow [2022-12-13 09:38:16,675 INFO L130 PetriNetUnfolder]: 277/757 cut-off events. [2022-12-13 09:38:16,675 INFO L131 PetriNetUnfolder]: For 900/934 co-relation queries the response was YES. [2022-12-13 09:38:16,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 757 events. 277/757 cut-off events. For 900/934 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5354 event pairs, 82 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 2252. Up to 342 conditions per place. [2022-12-13 09:38:16,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 58 transitions, 393 flow [2022-12-13 09:38:16,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-13 09:38:16,682 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:16,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 09:38:16,683 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 393 flow [2022-12-13 09:38:16,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 09:38:16,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:16,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:16,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:38:16,683 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 09:38:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash 459180756, now seen corresponding path program 1 times [2022-12-13 09:38:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:16,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559785127] [2022-12-13 09:38:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:16,829 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 09:38:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:16,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559785127] [2022-12-13 09:38:16,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559785127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:16,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:16,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222200113] [2022-12-13 09:38:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:16,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:16,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 09:38:16,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 09:38:16,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:16,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 09:38:16,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:17,217 INFO L130 PetriNetUnfolder]: 2755/4616 cut-off events. [2022-12-13 09:38:17,217 INFO L131 PetriNetUnfolder]: For 6425/6438 co-relation queries the response was YES. [2022-12-13 09:38:17,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15029 conditions, 4616 events. 2755/4616 cut-off events. For 6425/6438 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29066 event pairs, 413 based on Foata normal form. 14/3754 useless extension candidates. Maximal degree in co-relation 15006. Up to 3340 conditions per place. [2022-12-13 09:38:17,239 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 56 selfloop transitions, 11 changer transitions 2/86 dead transitions. [2022-12-13 09:38:17,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 693 flow [2022-12-13 09:38:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 09:38:17,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 09:38:17,242 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 393 flow. Second operand 4 states and 78 transitions. [2022-12-13 09:38:17,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 693 flow [2022-12-13 09:38:17,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 688 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:38:17,248 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 451 flow [2022-12-13 09:38:17,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2022-12-13 09:38:17,248 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2022-12-13 09:38:17,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:17,249 INFO L89 Accepts]: Start accepts. Operand has 57 places, 62 transitions, 451 flow [2022-12-13 09:38:17,249 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:17,249 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:17,249 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 62 transitions, 451 flow [2022-12-13 09:38:17,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 62 transitions, 451 flow [2022-12-13 09:38:17,313 INFO L130 PetriNetUnfolder]: 283/768 cut-off events. [2022-12-13 09:38:17,314 INFO L131 PetriNetUnfolder]: For 1247/1309 co-relation queries the response was YES. [2022-12-13 09:38:17,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 768 events. 283/768 cut-off events. For 1247/1309 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5474 event pairs, 54 based on Foata normal form. 5/591 useless extension candidates. Maximal degree in co-relation 2496. Up to 351 conditions per place. [2022-12-13 09:38:17,322 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 62 transitions, 451 flow [2022-12-13 09:38:17,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 864 [2022-12-13 09:38:17,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [355] L2-1-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_80 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_80 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) (.cse2 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5))) (and (= v_~y$r_buff0_thd0~0_79 (ite .cse0 0 v_~y$r_buff0_thd0~0_80)) (= v_~y$w_buff1_used~0_137 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_138)) (= v_~y~0_100 (ite .cse2 v_~y$w_buff0~0_74 (ite .cse1 v_~y$w_buff1~0_70 v_~y~0_101))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_137 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_79 256) 0)))) 0 v_~y$r_buff1_thd0~0_80) v_~y$r_buff1_thd0~0_79) (= (ite .cse2 0 v_~y$w_buff0_used~0_154) v_~y$w_buff0_used~0_153)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_80, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_100, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:38:17,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [400] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$r_buff0_thd3~0_52 1) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= v_~y$w_buff0_used~0_163 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_145 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= 2 v_~y$w_buff0~0_80) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_145)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_81, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_76, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 09:38:17,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [400] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$r_buff0_thd3~0_52 1) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= v_~y$w_buff0_used~0_163 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_145 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= 2 v_~y$w_buff0~0_80) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_145)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_81, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_76, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 09:38:17,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:17,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-13 09:38:17,734 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 458 flow [2022-12-13 09:38:17,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 09:38:17,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:17,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:17,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:38:17,734 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 09:38:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -400826601, now seen corresponding path program 1 times [2022-12-13 09:38:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:17,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540827495] [2022-12-13 09:38:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:17,948 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 09:38:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:17,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540827495] [2022-12-13 09:38:17,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540827495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:17,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:17,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019986523] [2022-12-13 09:38:17,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:17,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:17,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:17,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:38:17,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 09:38:17,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:17,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:38:17,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:18,277 INFO L130 PetriNetUnfolder]: 2619/4365 cut-off events. [2022-12-13 09:38:18,278 INFO L131 PetriNetUnfolder]: For 9146/9150 co-relation queries the response was YES. [2022-12-13 09:38:18,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15282 conditions, 4365 events. 2619/4365 cut-off events. For 9146/9150 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 27544 event pairs, 362 based on Foata normal form. 6/3506 useless extension candidates. Maximal degree in co-relation 15257. Up to 3328 conditions per place. [2022-12-13 09:38:18,299 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 52 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2022-12-13 09:38:18,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 730 flow [2022-12-13 09:38:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 09:38:18,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-13 09:38:18,301 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 458 flow. Second operand 4 states and 76 transitions. [2022-12-13 09:38:18,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 730 flow [2022-12-13 09:38:18,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 688 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:18,317 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 495 flow [2022-12-13 09:38:18,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=495, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2022-12-13 09:38:18,318 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2022-12-13 09:38:18,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:18,318 INFO L89 Accepts]: Start accepts. Operand has 58 places, 65 transitions, 495 flow [2022-12-13 09:38:18,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:18,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:18,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 65 transitions, 495 flow [2022-12-13 09:38:18,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 65 transitions, 495 flow [2022-12-13 09:38:18,365 INFO L130 PetriNetUnfolder]: 272/721 cut-off events. [2022-12-13 09:38:18,366 INFO L131 PetriNetUnfolder]: For 1332/1419 co-relation queries the response was YES. [2022-12-13 09:38:18,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 721 events. 272/721 cut-off events. For 1332/1419 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5020 event pairs, 49 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2318. Up to 334 conditions per place. [2022-12-13 09:38:18,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 65 transitions, 495 flow [2022-12-13 09:38:18,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 870 [2022-12-13 09:38:18,374 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:18,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 09:38:18,376 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 495 flow [2022-12-13 09:38:18,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 09:38:18,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:18,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:18,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:38:18,376 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 09:38:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash 459709554, now seen corresponding path program 1 times [2022-12-13 09:38:18,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:18,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25367609] [2022-12-13 09:38:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:18,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:18,685 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 09:38:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25367609] [2022-12-13 09:38:18,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25367609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:18,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:18,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935599284] [2022-12-13 09:38:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:18,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:18,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:18,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:38:18,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 495 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:18,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:18,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:38:18,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:19,023 INFO L130 PetriNetUnfolder]: 2568/4283 cut-off events. [2022-12-13 09:38:19,023 INFO L131 PetriNetUnfolder]: For 8648/8656 co-relation queries the response was YES. [2022-12-13 09:38:19,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14513 conditions, 4283 events. 2568/4283 cut-off events. For 8648/8656 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 26798 event pairs, 406 based on Foata normal form. 18/3458 useless extension candidates. Maximal degree in co-relation 14487. Up to 3297 conditions per place. [2022-12-13 09:38:19,044 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 50 selfloop transitions, 9 changer transitions 2/78 dead transitions. [2022-12-13 09:38:19,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 693 flow [2022-12-13 09:38:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 09:38:19,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2022-12-13 09:38:19,045 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 495 flow. Second operand 3 states and 62 transitions. [2022-12-13 09:38:19,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 693 flow [2022-12-13 09:38:19,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 669 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:19,066 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 481 flow [2022-12-13 09:38:19,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-13 09:38:19,067 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2022-12-13 09:38:19,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:19,067 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 481 flow [2022-12-13 09:38:19,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:19,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:19,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 481 flow [2022-12-13 09:38:19,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 481 flow [2022-12-13 09:38:19,110 INFO L130 PetriNetUnfolder]: 266/712 cut-off events. [2022-12-13 09:38:19,110 INFO L131 PetriNetUnfolder]: For 1387/1474 co-relation queries the response was YES. [2022-12-13 09:38:19,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 712 events. 266/712 cut-off events. For 1387/1474 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4980 event pairs, 44 based on Foata normal form. 2/545 useless extension candidates. Maximal degree in co-relation 2328. Up to 327 conditions per place. [2022-12-13 09:38:19,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 481 flow [2022-12-13 09:38:19,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-13 09:38:19,118 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:19,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 09:38:19,119 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 481 flow [2022-12-13 09:38:19,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:19,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:19,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:19,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:38:19,119 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 09:38:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash 459183360, now seen corresponding path program 1 times [2022-12-13 09:38:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:19,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897039537] [2022-12-13 09:38:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:19,440 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 09:38:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:19,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897039537] [2022-12-13 09:38:19,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897039537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:19,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:19,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457962425] [2022-12-13 09:38:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:19,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:19,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:38:19,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:19,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:19,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:38:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:19,778 INFO L130 PetriNetUnfolder]: 2516/4202 cut-off events. [2022-12-13 09:38:19,778 INFO L131 PetriNetUnfolder]: For 9046/9050 co-relation queries the response was YES. [2022-12-13 09:38:19,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14403 conditions, 4202 events. 2516/4202 cut-off events. For 9046/9050 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 26275 event pairs, 606 based on Foata normal form. 11/3365 useless extension candidates. Maximal degree in co-relation 14376. Up to 3313 conditions per place. [2022-12-13 09:38:19,798 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 62 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2022-12-13 09:38:19,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 819 flow [2022-12-13 09:38:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 09:38:19,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5808823529411765 [2022-12-13 09:38:19,800 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 481 flow. Second operand 4 states and 79 transitions. [2022-12-13 09:38:19,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 819 flow [2022-12-13 09:38:19,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:19,822 INFO L231 Difference]: Finished difference. Result has 61 places, 67 transitions, 535 flow [2022-12-13 09:38:19,823 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=61, PETRI_TRANSITIONS=67} [2022-12-13 09:38:19,823 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 09:38:19,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:19,823 INFO L89 Accepts]: Start accepts. Operand has 61 places, 67 transitions, 535 flow [2022-12-13 09:38:19,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:19,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:19,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 67 transitions, 535 flow [2022-12-13 09:38:19,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 67 transitions, 535 flow [2022-12-13 09:38:19,865 INFO L130 PetriNetUnfolder]: 260/687 cut-off events. [2022-12-13 09:38:19,865 INFO L131 PetriNetUnfolder]: For 1479/1567 co-relation queries the response was YES. [2022-12-13 09:38:19,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 687 events. 260/687 cut-off events. For 1479/1567 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4718 event pairs, 41 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 2370. Up to 314 conditions per place. [2022-12-13 09:38:19,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 67 transitions, 535 flow [2022-12-13 09:38:19,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 902 [2022-12-13 09:38:19,873 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:19,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 09:38:19,873 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 67 transitions, 535 flow [2022-12-13 09:38:19,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:19,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:19,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:19,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:38:19,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 459185003, now seen corresponding path program 1 times [2022-12-13 09:38:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:19,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251325113] [2022-12-13 09:38:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:20,085 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 09:38:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:20,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251325113] [2022-12-13 09:38:20,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251325113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:20,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:20,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664568884] [2022-12-13 09:38:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:20,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:20,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:38:20,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 67 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:20,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:20,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:38:20,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:20,427 INFO L130 PetriNetUnfolder]: 2632/4362 cut-off events. [2022-12-13 09:38:20,427 INFO L131 PetriNetUnfolder]: For 10588/10648 co-relation queries the response was YES. [2022-12-13 09:38:20,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15850 conditions, 4362 events. 2632/4362 cut-off events. For 10588/10648 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27141 event pairs, 396 based on Foata normal form. 11/3526 useless extension candidates. Maximal degree in co-relation 15822. Up to 3314 conditions per place. [2022-12-13 09:38:20,447 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 59 selfloop transitions, 16 changer transitions 2/94 dead transitions. [2022-12-13 09:38:20,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 869 flow [2022-12-13 09:38:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 09:38:20,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2022-12-13 09:38:20,449 INFO L175 Difference]: Start difference. First operand has 61 places, 67 transitions, 535 flow. Second operand 4 states and 78 transitions. [2022-12-13 09:38:20,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 869 flow [2022-12-13 09:38:20,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 849 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:20,479 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 638 flow [2022-12-13 09:38:20,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=638, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2022-12-13 09:38:20,479 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -1 predicate places. [2022-12-13 09:38:20,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:20,480 INFO L89 Accepts]: Start accepts. Operand has 63 places, 74 transitions, 638 flow [2022-12-13 09:38:20,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:20,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:20,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 74 transitions, 638 flow [2022-12-13 09:38:20,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 74 transitions, 638 flow [2022-12-13 09:38:20,525 INFO L130 PetriNetUnfolder]: 282/723 cut-off events. [2022-12-13 09:38:20,525 INFO L131 PetriNetUnfolder]: For 1888/1975 co-relation queries the response was YES. [2022-12-13 09:38:20,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2776 conditions, 723 events. 282/723 cut-off events. For 1888/1975 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4980 event pairs, 34 based on Foata normal form. 2/564 useless extension candidates. Maximal degree in co-relation 2750. Up to 342 conditions per place. [2022-12-13 09:38:20,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 74 transitions, 638 flow [2022-12-13 09:38:20,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 968 [2022-12-13 09:38:20,533 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:20,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 09:38:20,534 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 638 flow [2022-12-13 09:38:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:20,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:20,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:20,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:38:20,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 459276143, now seen corresponding path program 2 times [2022-12-13 09:38:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:20,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770751050] [2022-12-13 09:38:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:21,342 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 09:38:21,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:21,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770751050] [2022-12-13 09:38:21,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770751050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:21,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:21,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302287549] [2022-12-13 09:38:21,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:21,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:21,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:21,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:21,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:21,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:38:21,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 638 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 09:38:21,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:21,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:38:21,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:21,833 INFO L130 PetriNetUnfolder]: 3132/5062 cut-off events. [2022-12-13 09:38:21,834 INFO L131 PetriNetUnfolder]: For 13743/13743 co-relation queries the response was YES. [2022-12-13 09:38:21,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19349 conditions, 5062 events. 3132/5062 cut-off events. For 13743/13743 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 30525 event pairs, 163 based on Foata normal form. 9/4121 useless extension candidates. Maximal degree in co-relation 19320. Up to 2812 conditions per place. [2022-12-13 09:38:21,857 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 66 selfloop transitions, 46 changer transitions 13/132 dead transitions. [2022-12-13 09:38:21,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 132 transitions, 1254 flow [2022-12-13 09:38:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:38:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:38:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 09:38:21,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2022-12-13 09:38:21,858 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 638 flow. Second operand 6 states and 117 transitions. [2022-12-13 09:38:21,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 132 transitions, 1254 flow [2022-12-13 09:38:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 1223 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:21,883 INFO L231 Difference]: Finished difference. Result has 69 places, 89 transitions, 942 flow [2022-12-13 09:38:21,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=69, PETRI_TRANSITIONS=89} [2022-12-13 09:38:21,884 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2022-12-13 09:38:21,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:21,884 INFO L89 Accepts]: Start accepts. Operand has 69 places, 89 transitions, 942 flow [2022-12-13 09:38:21,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:21,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:21,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 89 transitions, 942 flow [2022-12-13 09:38:21,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 89 transitions, 942 flow [2022-12-13 09:38:21,938 INFO L130 PetriNetUnfolder]: 269/698 cut-off events. [2022-12-13 09:38:21,938 INFO L131 PetriNetUnfolder]: For 2732/2806 co-relation queries the response was YES. [2022-12-13 09:38:21,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 698 events. 269/698 cut-off events. For 2732/2806 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4775 event pairs, 27 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 3177. Up to 335 conditions per place. [2022-12-13 09:38:21,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 89 transitions, 942 flow [2022-12-13 09:38:21,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 1058 [2022-12-13 09:38:21,948 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:21,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 09:38:21,949 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 89 transitions, 942 flow [2022-12-13 09:38:21,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 09:38:21,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:21,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:21,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:38:21,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash -476023255, now seen corresponding path program 1 times [2022-12-13 09:38:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68972459] [2022-12-13 09:38:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:22,421 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 09:38:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68972459] [2022-12-13 09:38:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68972459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:22,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:22,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289741288] [2022-12-13 09:38:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:22,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 09:38:22,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 89 transitions, 942 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:22,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:22,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 09:38:22,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:22,811 INFO L130 PetriNetUnfolder]: 2483/4102 cut-off events. [2022-12-13 09:38:22,811 INFO L131 PetriNetUnfolder]: For 20305/20402 co-relation queries the response was YES. [2022-12-13 09:38:22,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18339 conditions, 4102 events. 2483/4102 cut-off events. For 20305/20402 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 25285 event pairs, 485 based on Foata normal form. 25/3283 useless extension candidates. Maximal degree in co-relation 18307. Up to 3251 conditions per place. [2022-12-13 09:38:22,830 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 70 selfloop transitions, 20 changer transitions 1/113 dead transitions. [2022-12-13 09:38:22,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 113 transitions, 1320 flow [2022-12-13 09:38:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 09:38:22,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-13 09:38:22,831 INFO L175 Difference]: Start difference. First operand has 69 places, 89 transitions, 942 flow. Second operand 5 states and 90 transitions. [2022-12-13 09:38:22,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 113 transitions, 1320 flow [2022-12-13 09:38:22,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 1286 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:22,861 INFO L231 Difference]: Finished difference. Result has 74 places, 94 transitions, 1051 flow [2022-12-13 09:38:22,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1051, PETRI_PLACES=74, PETRI_TRANSITIONS=94} [2022-12-13 09:38:22,862 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2022-12-13 09:38:22,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:22,862 INFO L89 Accepts]: Start accepts. Operand has 74 places, 94 transitions, 1051 flow [2022-12-13 09:38:22,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:22,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:22,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 94 transitions, 1051 flow [2022-12-13 09:38:22,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 94 transitions, 1051 flow [2022-12-13 09:38:22,910 INFO L130 PetriNetUnfolder]: 277/693 cut-off events. [2022-12-13 09:38:22,910 INFO L131 PetriNetUnfolder]: For 3301/3375 co-relation queries the response was YES. [2022-12-13 09:38:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 693 events. 277/693 cut-off events. For 3301/3375 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4550 event pairs, 28 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 3390. Up to 348 conditions per place. [2022-12-13 09:38:22,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 94 transitions, 1051 flow [2022-12-13 09:38:22,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-13 09:38:22,918 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:22,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 09:38:22,919 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 94 transitions, 1051 flow [2022-12-13 09:38:22,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:22,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:22,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:38:22,919 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1366093606, now seen corresponding path program 1 times [2022-12-13 09:38:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516993507] [2022-12-13 09:38:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:23,299 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 09:38:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:23,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516993507] [2022-12-13 09:38:23,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516993507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:23,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:23,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026526064] [2022-12-13 09:38:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:23,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:23,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 09:38:23,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 94 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 09:38:23,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:23,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 09:38:23,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:23,686 INFO L130 PetriNetUnfolder]: 2643/4386 cut-off events. [2022-12-13 09:38:23,686 INFO L131 PetriNetUnfolder]: For 26730/27051 co-relation queries the response was YES. [2022-12-13 09:38:23,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20068 conditions, 4386 events. 2643/4386 cut-off events. For 26730/27051 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 27902 event pairs, 425 based on Foata normal form. 170/3672 useless extension candidates. Maximal degree in co-relation 20033. Up to 2887 conditions per place. [2022-12-13 09:38:23,706 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 70 selfloop transitions, 28 changer transitions 2/122 dead transitions. [2022-12-13 09:38:23,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 1489 flow [2022-12-13 09:38:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 09:38:23,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 09:38:23,708 INFO L175 Difference]: Start difference. First operand has 74 places, 94 transitions, 1051 flow. Second operand 4 states and 81 transitions. [2022-12-13 09:38:23,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 1489 flow [2022-12-13 09:38:23,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 1456 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:23,736 INFO L231 Difference]: Finished difference. Result has 75 places, 97 transitions, 1159 flow [2022-12-13 09:38:23,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1159, PETRI_PLACES=75, PETRI_TRANSITIONS=97} [2022-12-13 09:38:23,736 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2022-12-13 09:38:23,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:23,736 INFO L89 Accepts]: Start accepts. Operand has 75 places, 97 transitions, 1159 flow [2022-12-13 09:38:23,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:23,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:23,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 97 transitions, 1159 flow [2022-12-13 09:38:23,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 97 transitions, 1159 flow [2022-12-13 09:38:23,784 INFO L130 PetriNetUnfolder]: 273/714 cut-off events. [2022-12-13 09:38:23,785 INFO L131 PetriNetUnfolder]: For 3659/3770 co-relation queries the response was YES. [2022-12-13 09:38:23,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 714 events. 273/714 cut-off events. For 3659/3770 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4990 event pairs, 32 based on Foata normal form. 3/564 useless extension candidates. Maximal degree in co-relation 3654. Up to 345 conditions per place. [2022-12-13 09:38:23,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 97 transitions, 1159 flow [2022-12-13 09:38:23,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-13 09:38:23,792 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:23,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 09:38:23,793 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 97 transitions, 1159 flow [2022-12-13 09:38:23,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 09:38:23,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:23,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:23,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:38:23,793 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1349829952, now seen corresponding path program 1 times [2022-12-13 09:38:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:23,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39915281] [2022-12-13 09:38:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:24,194 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 09:38:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39915281] [2022-12-13 09:38:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39915281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:24,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:24,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901048365] [2022-12-13 09:38:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:24,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:24,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:24,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 09:38:24,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 97 transitions, 1159 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 09:38:24,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:24,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 09:38:24,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:24,572 INFO L130 PetriNetUnfolder]: 2514/4200 cut-off events. [2022-12-13 09:38:24,572 INFO L131 PetriNetUnfolder]: For 28574/28868 co-relation queries the response was YES. [2022-12-13 09:38:24,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19639 conditions, 4200 events. 2514/4200 cut-off events. For 28574/28868 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 26623 event pairs, 445 based on Foata normal form. 161/3511 useless extension candidates. Maximal degree in co-relation 19603. Up to 2235 conditions per place. [2022-12-13 09:38:24,594 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 73 selfloop transitions, 21 changer transitions 1/117 dead transitions. [2022-12-13 09:38:24,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 117 transitions, 1473 flow [2022-12-13 09:38:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 09:38:24,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-13 09:38:24,595 INFO L175 Difference]: Start difference. First operand has 75 places, 97 transitions, 1159 flow. Second operand 4 states and 80 transitions. [2022-12-13 09:38:24,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 117 transitions, 1473 flow [2022-12-13 09:38:24,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 1424 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:24,630 INFO L231 Difference]: Finished difference. Result has 77 places, 96 transitions, 1158 flow [2022-12-13 09:38:24,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1158, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2022-12-13 09:38:24,630 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2022-12-13 09:38:24,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:24,631 INFO L89 Accepts]: Start accepts. Operand has 77 places, 96 transitions, 1158 flow [2022-12-13 09:38:24,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:24,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:24,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 96 transitions, 1158 flow [2022-12-13 09:38:24,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 96 transitions, 1158 flow [2022-12-13 09:38:24,690 INFO L130 PetriNetUnfolder]: 262/691 cut-off events. [2022-12-13 09:38:24,690 INFO L131 PetriNetUnfolder]: For 3735/3846 co-relation queries the response was YES. [2022-12-13 09:38:24,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3506 conditions, 691 events. 262/691 cut-off events. For 3735/3846 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4827 event pairs, 32 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 3472. Up to 331 conditions per place. [2022-12-13 09:38:24,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 96 transitions, 1158 flow [2022-12-13 09:38:24,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 1124 [2022-12-13 09:38:24,697 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:24,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 09:38:24,697 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 1158 flow [2022-12-13 09:38:24,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 09:38:24,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:24,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:24,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:38:24,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1446587095, now seen corresponding path program 1 times [2022-12-13 09:38:24,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:24,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231067002] [2022-12-13 09:38:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:25,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231067002] [2022-12-13 09:38:25,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231067002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:25,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:25,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:25,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932141963] [2022-12-13 09:38:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:25,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:25,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:25,031 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 09:38:25,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 1158 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 09:38:25,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:25,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 09:38:25,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:25,600 INFO L130 PetriNetUnfolder]: 4202/6902 cut-off events. [2022-12-13 09:38:25,600 INFO L131 PetriNetUnfolder]: For 33326/33326 co-relation queries the response was YES. [2022-12-13 09:38:25,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29004 conditions, 6902 events. 4202/6902 cut-off events. For 33326/33326 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 45666 event pairs, 754 based on Foata normal form. 75/5542 useless extension candidates. Maximal degree in co-relation 28967. Up to 2938 conditions per place. [2022-12-13 09:38:25,621 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 80 selfloop transitions, 18 changer transitions 30/135 dead transitions. [2022-12-13 09:38:25,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1709 flow [2022-12-13 09:38:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 09:38:25,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:38:25,623 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 1158 flow. Second operand 4 states and 88 transitions. [2022-12-13 09:38:25,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1709 flow [2022-12-13 09:38:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 135 transitions, 1657 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:25,661 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 952 flow [2022-12-13 09:38:25,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=952, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-12-13 09:38:25,661 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places. [2022-12-13 09:38:25,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:25,661 INFO L89 Accepts]: Start accepts. Operand has 78 places, 79 transitions, 952 flow [2022-12-13 09:38:25,662 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:25,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:25,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 79 transitions, 952 flow [2022-12-13 09:38:25,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 952 flow [2022-12-13 09:38:25,688 INFO L130 PetriNetUnfolder]: 127/407 cut-off events. [2022-12-13 09:38:25,689 INFO L131 PetriNetUnfolder]: For 1788/1790 co-relation queries the response was YES. [2022-12-13 09:38:25,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 407 events. 127/407 cut-off events. For 1788/1790 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2648 event pairs, 24 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 1898. Up to 184 conditions per place. [2022-12-13 09:38:25,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 79 transitions, 952 flow [2022-12-13 09:38:25,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 09:38:25,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L755-->L827: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_491 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd0~0_369 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_360 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff0_used~0_492 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_462 256) 0)))) (.cse0 (and .cse2 .cse5))) (and (= v_~y$r_buff0_thd0~0_359 (ite .cse0 0 v_~y$r_buff0_thd0~0_360)) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_461 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_359 256) 0)))) 0 v_~y$r_buff1_thd0~0_369) v_~y$r_buff1_thd0~0_368) (= v_~y~0_428 (ite .cse3 v_~y$w_buff0~0_356 (ite .cse4 v_~y$w_buff1~0_342 1))) (= v_~y$w_buff0_used~0_491 (ite .cse3 0 v_~y$w_buff0_used~0_492)) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_462) v_~y$w_buff1_used~0_461)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$w_buff1~0=v_~y$w_buff1~0_342, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_360, ~y$w_buff0~0=v_~y$w_buff0~0_356, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_462} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_491, ~y$w_buff1~0=v_~y$w_buff1~0_342, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_359, ~y$w_buff0~0=v_~y$w_buff0~0_356, ~y~0=v_~y~0_428, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_368, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_461} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [400] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$r_buff0_thd3~0_52 1) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= v_~y$w_buff0_used~0_163 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_145 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= 2 v_~y$w_buff0~0_80) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_145)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_81, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_76, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 09:38:25,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L755-->L827: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_491 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd0~0_369 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_360 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff0_used~0_492 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_462 256) 0)))) (.cse0 (and .cse2 .cse5))) (and (= v_~y$r_buff0_thd0~0_359 (ite .cse0 0 v_~y$r_buff0_thd0~0_360)) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_461 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_359 256) 0)))) 0 v_~y$r_buff1_thd0~0_369) v_~y$r_buff1_thd0~0_368) (= v_~y~0_428 (ite .cse3 v_~y$w_buff0~0_356 (ite .cse4 v_~y$w_buff1~0_342 1))) (= v_~y$w_buff0_used~0_491 (ite .cse3 0 v_~y$w_buff0_used~0_492)) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_462) v_~y$w_buff1_used~0_461)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$w_buff1~0=v_~y$w_buff1~0_342, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_360, ~y$w_buff0~0=v_~y$w_buff0~0_356, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_462} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_491, ~y$w_buff1~0=v_~y$w_buff1~0_342, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_359, ~y$w_buff0~0=v_~y$w_buff0~0_356, ~y~0=v_~y~0_428, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_368, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_461} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [317] L758-->L765: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_105 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_95 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_44 (ite .cse1 v_~y$w_buff1~0_41 v_~y~0_60)) v_~y~0_59) (= v_~y$w_buff1_used~0_94 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_95)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_25 (ite .cse2 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse0 0 v_~y$w_buff0_used~0_106))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 09:38:26,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:26,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-13 09:38:26,029 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 953 flow [2022-12-13 09:38:26,029 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 09:38:26,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:26,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:26,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 09:38:26,029 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1965353603, now seen corresponding path program 1 times [2022-12-13 09:38:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:26,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456882493] [2022-12-13 09:38:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:26,112 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 09:38:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456882493] [2022-12-13 09:38:26,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456882493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:26,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:26,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:26,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218507334] [2022-12-13 09:38:26,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:26,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:26,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:38:26,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 953 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 09:38:26,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:26,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:38:26,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:26,437 INFO L130 PetriNetUnfolder]: 2450/3976 cut-off events. [2022-12-13 09:38:26,437 INFO L131 PetriNetUnfolder]: For 22778/22850 co-relation queries the response was YES. [2022-12-13 09:38:26,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 3976 events. 2450/3976 cut-off events. For 22778/22850 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 24354 event pairs, 878 based on Foata normal form. 103/2516 useless extension candidates. Maximal degree in co-relation 15527. Up to 3811 conditions per place. [2022-12-13 09:38:26,450 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 66 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2022-12-13 09:38:26,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 1110 flow [2022-12-13 09:38:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 09:38:26,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-13 09:38:26,452 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 953 flow. Second operand 3 states and 63 transitions. [2022-12-13 09:38:26,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 1110 flow [2022-12-13 09:38:26,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 968 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-12-13 09:38:26,470 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 663 flow [2022-12-13 09:38:26,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2022-12-13 09:38:26,470 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2022-12-13 09:38:26,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:26,471 INFO L89 Accepts]: Start accepts. Operand has 70 places, 71 transitions, 663 flow [2022-12-13 09:38:26,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:26,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:26,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 71 transitions, 663 flow [2022-12-13 09:38:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 71 transitions, 663 flow [2022-12-13 09:38:26,580 INFO L130 PetriNetUnfolder]: 1282/2452 cut-off events. [2022-12-13 09:38:26,580 INFO L131 PetriNetUnfolder]: For 3579/3624 co-relation queries the response was YES. [2022-12-13 09:38:26,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7094 conditions, 2452 events. 1282/2452 cut-off events. For 3579/3624 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 19305 event pairs, 574 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 7064. Up to 1939 conditions per place. [2022-12-13 09:38:26,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 71 transitions, 663 flow [2022-12-13 09:38:26,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-13 09:38:26,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] $Ultimate##0-->L755: Formula: (and (= v_~x~0_15 2) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [400] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$r_buff0_thd3~0_52 1) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= v_~y$w_buff0_used~0_163 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_145 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= 2 v_~y$w_buff0~0_80) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_145)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_81, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_76, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 09:38:26,915 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:38:26,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 446 [2022-12-13 09:38:26,916 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 677 flow [2022-12-13 09:38:26,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 09:38:26,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:26,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 09:38:26,916 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -484800566, now seen corresponding path program 1 times [2022-12-13 09:38:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:26,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263286835] [2022-12-13 09:38:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:26,990 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 09:38:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263286835] [2022-12-13 09:38:26,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263286835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:26,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:26,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:26,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113385061] [2022-12-13 09:38:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:26,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:26,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:38:26,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 677 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 09:38:26,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:26,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:38:26,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:27,183 INFO L130 PetriNetUnfolder]: 1255/2322 cut-off events. [2022-12-13 09:38:27,183 INFO L131 PetriNetUnfolder]: For 9304/9425 co-relation queries the response was YES. [2022-12-13 09:38:27,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10252 conditions, 2322 events. 1255/2322 cut-off events. For 9304/9425 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 14956 event pairs, 166 based on Foata normal form. 140/1587 useless extension candidates. Maximal degree in co-relation 10219. Up to 1954 conditions per place. [2022-12-13 09:38:27,191 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 69 selfloop transitions, 19 changer transitions 4/103 dead transitions. [2022-12-13 09:38:27,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 1166 flow [2022-12-13 09:38:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 09:38:27,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 09:38:27,193 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 677 flow. Second operand 4 states and 85 transitions. [2022-12-13 09:38:27,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 1166 flow [2022-12-13 09:38:27,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 1116 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 09:38:27,201 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 721 flow [2022-12-13 09:38:27,201 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2022-12-13 09:38:27,201 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2022-12-13 09:38:27,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:27,202 INFO L89 Accepts]: Start accepts. Operand has 70 places, 78 transitions, 721 flow [2022-12-13 09:38:27,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:27,202 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:27,202 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 78 transitions, 721 flow [2022-12-13 09:38:27,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 78 transitions, 721 flow [2022-12-13 09:38:27,302 INFO L130 PetriNetUnfolder]: 794/1739 cut-off events. [2022-12-13 09:38:27,303 INFO L131 PetriNetUnfolder]: For 4522/4802 co-relation queries the response was YES. [2022-12-13 09:38:27,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7124 conditions, 1739 events. 794/1739 cut-off events. For 4522/4802 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 13463 event pairs, 99 based on Foata normal form. 15/1053 useless extension candidates. Maximal degree in co-relation 7095. Up to 1204 conditions per place. [2022-12-13 09:38:27,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 78 transitions, 721 flow [2022-12-13 09:38:27,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 09:38:27,315 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:27,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 09:38:27,316 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 721 flow [2022-12-13 09:38:27,316 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 09:38:27,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:27,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:27,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 09:38:27,316 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1181150319, now seen corresponding path program 1 times [2022-12-13 09:38:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:27,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91761326] [2022-12-13 09:38:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:27,406 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 09:38:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:27,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91761326] [2022-12-13 09:38:27,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91761326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:27,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:27,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947589726] [2022-12-13 09:38:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:27,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:27,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:27,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:27,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 09:38:27,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 721 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 09:38:27,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:27,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 09:38:27,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:27,536 INFO L130 PetriNetUnfolder]: 564/1181 cut-off events. [2022-12-13 09:38:27,537 INFO L131 PetriNetUnfolder]: For 3690/3955 co-relation queries the response was YES. [2022-12-13 09:38:27,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6011 conditions, 1181 events. 564/1181 cut-off events. For 3690/3955 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7287 event pairs, 4 based on Foata normal form. 205/873 useless extension candidates. Maximal degree in co-relation 5979. Up to 814 conditions per place. [2022-12-13 09:38:27,541 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 33 selfloop transitions, 28 changer transitions 32/99 dead transitions. [2022-12-13 09:38:27,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 1126 flow [2022-12-13 09:38:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 09:38:27,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2022-12-13 09:38:27,542 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 721 flow. Second operand 5 states and 91 transitions. [2022-12-13 09:38:27,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 1126 flow [2022-12-13 09:38:27,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 1036 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-13 09:38:27,548 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 440 flow [2022-12-13 09:38:27,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2022-12-13 09:38:27,549 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2022-12-13 09:38:27,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:27,549 INFO L89 Accepts]: Start accepts. Operand has 71 places, 54 transitions, 440 flow [2022-12-13 09:38:27,549 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:27,549 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:27,549 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 54 transitions, 440 flow [2022-12-13 09:38:27,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 440 flow [2022-12-13 09:38:27,567 INFO L130 PetriNetUnfolder]: 113/318 cut-off events. [2022-12-13 09:38:27,568 INFO L131 PetriNetUnfolder]: For 283/337 co-relation queries the response was YES. [2022-12-13 09:38:27,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 318 events. 113/318 cut-off events. For 283/337 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1912 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 1165. Up to 217 conditions per place. [2022-12-13 09:38:27,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 54 transitions, 440 flow [2022-12-13 09:38:27,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-13 09:38:28,722 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:38:28,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1174 [2022-12-13 09:38:28,723 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 447 flow [2022-12-13 09:38:28,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 09:38:28,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:28,723 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 09:38:28,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 09:38:28,724 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:38:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1773950635, now seen corresponding path program 1 times [2022-12-13 09:38:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:28,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395727515] [2022-12-13 09:38:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:38:28,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:38:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:38:28,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:38:28,817 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:38:28,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:38:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:38:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:38:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:38:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:38:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:38:28,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 09:38:28,821 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:28,826 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:38:28,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:38:28,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:38:28 BasicIcfg [2022-12-13 09:38:28,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:38:28,890 INFO L158 Benchmark]: Toolchain (without parser) took 24894.82ms. Allocated memory was 187.7MB in the beginning and 882.9MB in the end (delta: 695.2MB). Free memory was 145.7MB in the beginning and 566.7MB in the end (delta: -421.0MB). Peak memory consumption was 275.3MB. Max. memory is 8.0GB. [2022-12-13 09:38:28,890 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:38:28,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.20ms. Allocated memory is still 187.7MB. Free memory was 145.7MB in the beginning and 120.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 09:38:28,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.46ms. Allocated memory is still 187.7MB. Free memory was 120.0MB in the beginning and 116.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:28,891 INFO L158 Benchmark]: Boogie Preprocessor took 23.56ms. Allocated memory is still 187.7MB. Free memory was 116.9MB in the beginning and 115.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:28,895 INFO L158 Benchmark]: RCFGBuilder took 530.83ms. Allocated memory is still 187.7MB. Free memory was 115.3MB in the beginning and 82.8MB in the end (delta: 32.6MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 09:38:28,896 INFO L158 Benchmark]: TraceAbstraction took 23870.36ms. Allocated memory was 187.7MB in the beginning and 882.9MB in the end (delta: 695.2MB). Free memory was 81.8MB in the beginning and 566.7MB in the end (delta: -484.9MB). Peak memory consumption was 211.3MB. Max. memory is 8.0GB. [2022-12-13 09:38:28,897 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.20ms. Allocated memory is still 187.7MB. Free memory was 145.7MB in the beginning and 120.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.46ms. Allocated memory is still 187.7MB. Free memory was 120.0MB in the beginning and 116.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.56ms. Allocated memory is still 187.7MB. Free memory was 116.9MB in the beginning and 115.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 530.83ms. Allocated memory is still 187.7MB. Free memory was 115.3MB in the beginning and 82.8MB in the end (delta: 32.6MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23870.36ms. Allocated memory was 187.7MB in the beginning and 882.9MB in the end (delta: 695.2MB). Free memory was 81.8MB in the beginning and 566.7MB in the end (delta: -484.9MB). Peak memory consumption was 211.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 110 PlacesBefore, 64 PlacesAfterwards, 102 TransitionsBefore, 54 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3148, independent: 2926, independent conditional: 2926, independent unconditional: 0, dependent: 222, dependent conditional: 222, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1817, independent: 1764, independent conditional: 0, independent unconditional: 1764, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1817, independent: 1764, independent conditional: 0, independent unconditional: 1764, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1817, independent: 1703, independent conditional: 0, independent unconditional: 1703, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 114, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3148, independent: 1162, independent conditional: 1162, independent unconditional: 0, dependent: 169, dependent conditional: 169, dependent unconditional: 0, unknown: 1817, unknown conditional: 1817, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1821, Positive cache size: 1768, Positive conditional cache size: 1768, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 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: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, independent: 198, independent conditional: 14, independent unconditional: 184, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 218, independent: 198, independent conditional: 14, independent unconditional: 184, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 218, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 32, dependent conditional: 7, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 218, unknown conditional: 218, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 219, Positive conditional cache size: 219, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 8, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 225, Positive conditional cache size: 225, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 235, Positive conditional cache size: 235, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 235, Positive conditional cache size: 235, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 57 PlacesBefore, 56 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 80, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 28, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 50, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 249, Positive conditional cache size: 249, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 249, Positive conditional cache size: 249, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 249, Positive conditional cache size: 249, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 249, Positive conditional cache size: 249, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 78 PlacesBefore, 77 PlacesAfterwards, 79 TransitionsBefore, 78 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 42, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 70 PlacesBefore, 70 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 20, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 20, independent unconditional: 8, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 33, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 279, Positive conditional cache size: 279, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 279, Positive conditional cache size: 279, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 67 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 288, Positive conditional cache size: 288, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={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] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 z = 1 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; VAL [\result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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: 23.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 32 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1159occurred in iteration=13, InterpolantAutomatonStates: 71, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 2230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:38:28,936 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...