/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/mix045_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:27:06,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:27:06,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:27:06,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:27:06,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:27:06,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:27:06,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:27:07,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:27:07,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:27:07,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:27:07,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:27:07,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:27:07,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:27:07,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:27:07,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:27:07,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:27:07,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:27:07,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:27:07,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:27:07,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:27:07,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:27:07,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:27:07,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:27:07,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:27:07,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:27:07,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:27:07,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:27:07,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:27:07,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:27:07,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:27:07,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:27:07,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:27:07,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:27:07,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:27:07,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:27:07,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:27:07,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:27:07,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:27:07,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:27:07,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:27:07,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:27:07,059 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:27:07,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:27:07,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:27:07,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:27:07,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:27:07,090 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:27:07,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:27:07,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:27:07,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:27:07,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:27:07,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:27:07,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:27:07,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:27:07,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:27:07,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:27:07,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:27:07,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:27:07,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:27:07,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:27:07,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:27:07,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:27:07,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:27:07,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:27:07,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:27:07,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:27:07,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:27:07,094 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:27:07,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:27:07,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:27:07,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:27:07,095 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:27:07,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:27:07,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:27:07,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:27:07,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:27:07,459 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:27:07,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 09:27:08,713 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:27:09,023 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:27:09,023 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 09:27:09,041 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3964e51bd/3a45749ad47b4b62a7ee83f683886e8c/FLAGce8c7a6f1 [2022-12-13 09:27:09,055 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3964e51bd/3a45749ad47b4b62a7ee83f683886e8c [2022-12-13 09:27:09,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:27:09,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:27:09,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:27:09,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:27:09,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:27:09,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f5703c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09, skipping insertion in model container [2022-12-13 09:27:09,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:27:09,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:27:09,267 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/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 09:27:09,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:27:09,516 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:27:09,528 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/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 09:27:09,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:27:09,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:27:09,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:27:09,647 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:27:09,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09 WrapperNode [2022-12-13 09:27:09,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:27:09,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:27:09,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:27:09,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:27:09,656 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:27:09" (1/1) ... [2022-12-13 09:27:09,689 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:27:09" (1/1) ... [2022-12-13 09:27:09,721 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-13 09:27:09,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:27:09,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:27:09,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:27:09,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:27:09,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,757 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:27:09,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:27:09,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:27:09,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:27:09,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (1/1) ... [2022-12-13 09:27:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:27:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:27:09,810 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:27:09,835 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:27:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:27:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:27:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:27:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:27:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:27:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:27:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:27:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:27:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:27:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:27:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:27:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:27:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:27:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:27:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:27:09,854 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:27:10,044 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:27:10,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:27:10,353 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:27:10,483 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:27:10,484 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:27:10,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:27:10 BoogieIcfgContainer [2022-12-13 09:27:10,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:27:10,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:27:10,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:27:10,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:27:10,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:27:09" (1/3) ... [2022-12-13 09:27:10,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2cb153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:27:10, skipping insertion in model container [2022-12-13 09:27:10,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:27:09" (2/3) ... [2022-12-13 09:27:10,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2cb153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:27:10, skipping insertion in model container [2022-12-13 09:27:10,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:27:10" (3/3) ... [2022-12-13 09:27:10,494 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 09:27:10,510 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:27:10,510 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:27:10,510 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:27:10,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:27:10,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 09:27:10,675 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 09:27:10,676 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:27:10,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 09:27:10,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 09:27:10,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-13 09:27:10,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:10,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 09:27:10,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-13 09:27:10,743 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 09:27:10,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:27:10,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 09:27:10,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 09:27:10,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 09:27:15,707 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 09:27:15,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:27:15,729 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;@2090f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:27:15,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:27:15,732 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-13 09:27:15,732 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:27:15,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:15,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:27:15,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 487117, now seen corresponding path program 1 times [2022-12-13 09:27:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:15,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273191399] [2022-12-13 09:27:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:16,108 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:27:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:16,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273191399] [2022-12-13 09:27:16,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273191399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:16,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:16,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:27:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926273933] [2022-12-13 09:27:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:16,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:27:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:27:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:27:16,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-13 09:27:16,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:16,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:16,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-13 09:27:16,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:18,004 INFO L130 PetriNetUnfolder]: 10840/16716 cut-off events. [2022-12-13 09:27:18,004 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 09:27:18,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32179 conditions, 16716 events. 10840/16716 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 117475 event pairs, 4869 based on Foata normal form. 0/9824 useless extension candidates. Maximal degree in co-relation 32168. Up to 13045 conditions per place. [2022-12-13 09:27:18,078 INFO L137 encePairwiseOnDemand]: 63/67 looper letters, 38 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-13 09:27:18,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 433 flow [2022-12-13 09:27:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:27:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:27:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-13 09:27:18,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2022-12-13 09:27:18,092 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 143 flow. Second operand 3 states and 140 transitions. [2022-12-13 09:27:18,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 433 flow [2022-12-13 09:27:18,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:27:18,099 INFO L231 Difference]: Finished difference. Result has 74 places, 35 transitions, 80 flow [2022-12-13 09:27:18,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=74, PETRI_TRANSITIONS=35} [2022-12-13 09:27:18,105 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2022-12-13 09:27:18,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:18,106 INFO L89 Accepts]: Start accepts. Operand has 74 places, 35 transitions, 80 flow [2022-12-13 09:27:18,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:18,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:18,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 35 transitions, 80 flow [2022-12-13 09:27:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2022-12-13 09:27:18,119 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 09:27:18,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:27:18,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:27:18,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2022-12-13 09:27:18,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 09:27:18,294 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:18,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-13 09:27:18,297 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2022-12-13 09:27:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:18,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:18,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:18,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:27:18,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 157401001, now seen corresponding path program 1 times [2022-12-13 09:27:18,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:18,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116516018] [2022-12-13 09:27:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:18,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:27:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:18,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116516018] [2022-12-13 09:27:18,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116516018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:18,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:18,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:27:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223476437] [2022-12-13 09:27:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:18,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:27:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:27:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:27:18,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 09:27:18,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:18,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:18,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 09:27:18,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:19,451 INFO L130 PetriNetUnfolder]: 5709/8736 cut-off events. [2022-12-13 09:27:19,451 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2022-12-13 09:27:19,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17603 conditions, 8736 events. 5709/8736 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 52447 event pairs, 1927 based on Foata normal form. 0/7012 useless extension candidates. Maximal degree in co-relation 17593. Up to 4537 conditions per place. [2022-12-13 09:27:19,501 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 39 selfloop transitions, 8 changer transitions 2/57 dead transitions. [2022-12-13 09:27:19,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 226 flow [2022-12-13 09:27:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:27:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:27:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 09:27:19,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2022-12-13 09:27:19,503 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 80 flow. Second operand 3 states and 74 transitions. [2022-12-13 09:27:19,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 226 flow [2022-12-13 09:27:19,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:27:19,507 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 136 flow [2022-12-13 09:27:19,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-13 09:27:19,508 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -31 predicate places. [2022-12-13 09:27:19,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:19,508 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 136 flow [2022-12-13 09:27:19,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:19,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:19,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 136 flow [2022-12-13 09:27:19,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 136 flow [2022-12-13 09:27:19,543 INFO L130 PetriNetUnfolder]: 92/401 cut-off events. [2022-12-13 09:27:19,544 INFO L131 PetriNetUnfolder]: For 40/43 co-relation queries the response was YES. [2022-12-13 09:27:19,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 401 events. 92/401 cut-off events. For 40/43 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2991 event pairs, 36 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 674. Up to 117 conditions per place. [2022-12-13 09:27:19,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 136 flow [2022-12-13 09:27:19,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-13 09:27:19,580 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:19,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 09:27:19,582 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 136 flow [2022-12-13 09:27:19,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:19,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:19,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:19,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:27:19,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 584462624, now seen corresponding path program 1 times [2022-12-13 09:27:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:19,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700248319] [2022-12-13 09:27:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:19,767 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:27:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:19,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700248319] [2022-12-13 09:27:19,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700248319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:19,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:19,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:27:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070750226] [2022-12-13 09:27:19,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:27:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:27:19,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:27:19,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:27:19,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:19,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:19,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:27:19,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:20,400 INFO L130 PetriNetUnfolder]: 4342/6894 cut-off events. [2022-12-13 09:27:20,400 INFO L131 PetriNetUnfolder]: For 2231/2231 co-relation queries the response was YES. [2022-12-13 09:27:20,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16414 conditions, 6894 events. 4342/6894 cut-off events. For 2231/2231 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 42176 event pairs, 270 based on Foata normal form. 6/5769 useless extension candidates. Maximal degree in co-relation 16402. Up to 3429 conditions per place. [2022-12-13 09:27:20,446 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 46 selfloop transitions, 14 changer transitions 0/68 dead transitions. [2022-12-13 09:27:20,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 336 flow [2022-12-13 09:27:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:27:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:27:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 09:27:20,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6544117647058824 [2022-12-13 09:27:20,448 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 136 flow. Second operand 4 states and 89 transitions. [2022-12-13 09:27:20,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 336 flow [2022-12-13 09:27:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:27:20,457 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 208 flow [2022-12-13 09:27:20,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2022-12-13 09:27:20,458 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -28 predicate places. [2022-12-13 09:27:20,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:20,458 INFO L89 Accepts]: Start accepts. Operand has 49 places, 47 transitions, 208 flow [2022-12-13 09:27:20,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:20,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:20,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 47 transitions, 208 flow [2022-12-13 09:27:20,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 208 flow [2022-12-13 09:27:20,483 INFO L130 PetriNetUnfolder]: 80/372 cut-off events. [2022-12-13 09:27:20,483 INFO L131 PetriNetUnfolder]: For 151/184 co-relation queries the response was YES. [2022-12-13 09:27:20,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 372 events. 80/372 cut-off events. For 151/184 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2691 event pairs, 21 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 737. Up to 105 conditions per place. [2022-12-13 09:27:20,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 208 flow [2022-12-13 09:27:20,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 870 [2022-12-13 09:27:20,505 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:20,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 09:27:20,507 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 208 flow [2022-12-13 09:27:20,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:20,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:20,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:20,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:27:20,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 584463368, now seen corresponding path program 1 times [2022-12-13 09:27:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240170885] [2022-12-13 09:27:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:20,629 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:27:20,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:20,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240170885] [2022-12-13 09:27:20,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240170885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:20,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:20,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:27:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507897527] [2022-12-13 09:27:20,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:20,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:27:20,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:27:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:27:20,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:27:20,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:20,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:20,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:27:20,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:21,299 INFO L130 PetriNetUnfolder]: 4263/6748 cut-off events. [2022-12-13 09:27:21,299 INFO L131 PetriNetUnfolder]: For 4406/4406 co-relation queries the response was YES. [2022-12-13 09:27:21,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17389 conditions, 6748 events. 4263/6748 cut-off events. For 4406/4406 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 40972 event pairs, 621 based on Foata normal form. 14/5644 useless extension candidates. Maximal degree in co-relation 17374. Up to 3331 conditions per place. [2022-12-13 09:27:21,336 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 54 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2022-12-13 09:27:21,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 450 flow [2022-12-13 09:27:21,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:27:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:27:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 09:27:21,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-13 09:27:21,340 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 208 flow. Second operand 4 states and 96 transitions. [2022-12-13 09:27:21,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 450 flow [2022-12-13 09:27:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:27:21,350 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 309 flow [2022-12-13 09:27:21,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-12-13 09:27:21,355 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -23 predicate places. [2022-12-13 09:27:21,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:21,355 INFO L89 Accepts]: Start accepts. Operand has 54 places, 53 transitions, 309 flow [2022-12-13 09:27:21,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:21,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:21,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 53 transitions, 309 flow [2022-12-13 09:27:21,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 309 flow [2022-12-13 09:27:21,400 INFO L130 PetriNetUnfolder]: 68/332 cut-off events. [2022-12-13 09:27:21,401 INFO L131 PetriNetUnfolder]: For 435/477 co-relation queries the response was YES. [2022-12-13 09:27:21,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 332 events. 68/332 cut-off events. For 435/477 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2368 event pairs, 10 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 801. Up to 89 conditions per place. [2022-12-13 09:27:21,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 53 transitions, 309 flow [2022-12-13 09:27:21,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 942 [2022-12-13 09:27:21,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:21,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 09:27:21,444 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 309 flow [2022-12-13 09:27:21,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:21,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:21,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:21,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:27:21,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 938471824, now seen corresponding path program 1 times [2022-12-13 09:27:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98385472] [2022-12-13 09:27:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:21,684 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:27:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:21,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98385472] [2022-12-13 09:27:21,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98385472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:21,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:21,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:27:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239471780] [2022-12-13 09:27:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:21,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:27:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:27:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:27:21,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:27:21,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:27:21,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:21,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:27:21,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:22,645 INFO L130 PetriNetUnfolder]: 4055/6368 cut-off events. [2022-12-13 09:27:22,648 INFO L131 PetriNetUnfolder]: For 9093/9093 co-relation queries the response was YES. [2022-12-13 09:27:22,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18252 conditions, 6368 events. 4055/6368 cut-off events. For 9093/9093 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36889 event pairs, 1022 based on Foata normal form. 68/5364 useless extension candidates. Maximal degree in co-relation 18233. Up to 2432 conditions per place. [2022-12-13 09:27:22,691 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 62 selfloop transitions, 8 changer transitions 4/82 dead transitions. [2022-12-13 09:27:22,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 569 flow [2022-12-13 09:27:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:27:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:27:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 09:27:22,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6397058823529411 [2022-12-13 09:27:22,692 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 309 flow. Second operand 4 states and 87 transitions. [2022-12-13 09:27:22,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 569 flow [2022-12-13 09:27:22,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 567 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 09:27:22,724 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 354 flow [2022-12-13 09:27:22,724 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2022-12-13 09:27:22,726 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -17 predicate places. [2022-12-13 09:27:22,726 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:22,726 INFO L89 Accepts]: Start accepts. Operand has 60 places, 53 transitions, 354 flow [2022-12-13 09:27:22,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:22,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:22,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 53 transitions, 354 flow [2022-12-13 09:27:22,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 354 flow [2022-12-13 09:27:22,748 INFO L130 PetriNetUnfolder]: 45/223 cut-off events. [2022-12-13 09:27:22,748 INFO L131 PetriNetUnfolder]: For 502/514 co-relation queries the response was YES. [2022-12-13 09:27:22,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 223 events. 45/223 cut-off events. For 502/514 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1315 event pairs, 5 based on Foata normal form. 1/165 useless extension candidates. Maximal degree in co-relation 622. Up to 59 conditions per place. [2022-12-13 09:27:22,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 354 flow [2022-12-13 09:27:22,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 09:27:22,758 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:22,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 09:27:22,760 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 354 flow [2022-12-13 09:27:22,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:27:22,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:22,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:22,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:27:22,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 293045609, now seen corresponding path program 1 times [2022-12-13 09:27:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:22,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220953326] [2022-12-13 09:27:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:22,899 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:27:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:22,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220953326] [2022-12-13 09:27:22,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220953326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:22,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:27:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362362839] [2022-12-13 09:27:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:22,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:27:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:27:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:27:22,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:27:22,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:27:22,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:22,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:27:22,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:23,475 INFO L130 PetriNetUnfolder]: 3641/5851 cut-off events. [2022-12-13 09:27:23,475 INFO L131 PetriNetUnfolder]: For 9334/9544 co-relation queries the response was YES. [2022-12-13 09:27:23,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15974 conditions, 5851 events. 3641/5851 cut-off events. For 9334/9544 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 36100 event pairs, 967 based on Foata normal form. 152/4252 useless extension candidates. Maximal degree in co-relation 15950. Up to 5467 conditions per place. [2022-12-13 09:27:23,516 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 51 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2022-12-13 09:27:23,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 613 flow [2022-12-13 09:27:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:27:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:27:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 09:27:23,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 09:27:23,518 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 354 flow. Second operand 3 states and 70 transitions. [2022-12-13 09:27:23,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 613 flow [2022-12-13 09:27:23,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 610 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:27:23,527 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 419 flow [2022-12-13 09:27:23,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2022-12-13 09:27:23,528 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -16 predicate places. [2022-12-13 09:27:23,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:23,528 INFO L89 Accepts]: Start accepts. Operand has 61 places, 62 transitions, 419 flow [2022-12-13 09:27:23,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:23,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:23,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 419 flow [2022-12-13 09:27:23,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 419 flow [2022-12-13 09:27:23,685 INFO L130 PetriNetUnfolder]: 833/1833 cut-off events. [2022-12-13 09:27:23,685 INFO L131 PetriNetUnfolder]: For 1952/2031 co-relation queries the response was YES. [2022-12-13 09:27:23,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 1833 events. 833/1833 cut-off events. For 1952/2031 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 15107 event pairs, 375 based on Foata normal form. 3/1051 useless extension candidates. Maximal degree in co-relation 4362. Up to 1285 conditions per place. [2022-12-13 09:27:23,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 419 flow [2022-12-13 09:27:23,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-13 09:27:23,721 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:23,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-13 09:27:23,722 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 419 flow [2022-12-13 09:27:23,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:27:23,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:23,723 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:27:23,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:27:23,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1103514109, now seen corresponding path program 1 times [2022-12-13 09:27:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896578387] [2022-12-13 09:27:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:23,865 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:27:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896578387] [2022-12-13 09:27:23,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896578387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:27:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060916824] [2022-12-13 09:27:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:23,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:27:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:27:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:27:23,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:27:23,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:23,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:23,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:27:23,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:24,175 INFO L130 PetriNetUnfolder]: 1715/3199 cut-off events. [2022-12-13 09:27:24,175 INFO L131 PetriNetUnfolder]: For 4957/5038 co-relation queries the response was YES. [2022-12-13 09:27:24,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 3199 events. 1715/3199 cut-off events. For 4957/5038 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 21114 event pairs, 223 based on Foata normal form. 278/2527 useless extension candidates. Maximal degree in co-relation 10715. Up to 2161 conditions per place. [2022-12-13 09:27:24,194 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 62 selfloop transitions, 19 changer transitions 0/100 dead transitions. [2022-12-13 09:27:24,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 801 flow [2022-12-13 09:27:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:27:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:27:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 09:27:24,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 09:27:24,196 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 419 flow. Second operand 4 states and 96 transitions. [2022-12-13 09:27:24,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 801 flow [2022-12-13 09:27:24,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 791 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:27:24,210 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 521 flow [2022-12-13 09:27:24,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=521, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2022-12-13 09:27:24,211 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2022-12-13 09:27:24,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:24,211 INFO L89 Accepts]: Start accepts. Operand has 64 places, 71 transitions, 521 flow [2022-12-13 09:27:24,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:24,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:24,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 71 transitions, 521 flow [2022-12-13 09:27:24,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 71 transitions, 521 flow [2022-12-13 09:27:24,320 INFO L130 PetriNetUnfolder]: 488/1272 cut-off events. [2022-12-13 09:27:24,320 INFO L131 PetriNetUnfolder]: For 1319/1656 co-relation queries the response was YES. [2022-12-13 09:27:24,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 1272 events. 488/1272 cut-off events. For 1319/1656 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 10399 event pairs, 90 based on Foata normal form. 10/770 useless extension candidates. Maximal degree in co-relation 4026. Up to 877 conditions per place. [2022-12-13 09:27:24,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 71 transitions, 521 flow [2022-12-13 09:27:24,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 1080 [2022-12-13 09:27:24,369 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:24,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 09:27:24,370 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 521 flow [2022-12-13 09:27:24,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:24,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:24,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:24,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:27:24,371 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:24,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1062116465, now seen corresponding path program 1 times [2022-12-13 09:27:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:24,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823665578] [2022-12-13 09:27:24,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:24,551 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:27:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:24,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823665578] [2022-12-13 09:27:24,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823665578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:24,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:24,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:27:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989722127] [2022-12-13 09:27:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:24,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:27:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:27:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:27:24,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 09:27:24,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:24,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:24,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 09:27:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:24,950 INFO L130 PetriNetUnfolder]: 2458/4751 cut-off events. [2022-12-13 09:27:24,950 INFO L131 PetriNetUnfolder]: For 9723/10347 co-relation queries the response was YES. [2022-12-13 09:27:24,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18102 conditions, 4751 events. 2458/4751 cut-off events. For 9723/10347 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 35804 event pairs, 780 based on Foata normal form. 381/4305 useless extension candidates. Maximal degree in co-relation 18074. Up to 2610 conditions per place. [2022-12-13 09:27:24,984 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 60 selfloop transitions, 11 changer transitions 9/101 dead transitions. [2022-12-13 09:27:24,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 857 flow [2022-12-13 09:27:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:27:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:27:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 09:27:24,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 09:27:24,985 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 521 flow. Second operand 3 states and 72 transitions. [2022-12-13 09:27:24,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 857 flow [2022-12-13 09:27:24,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 795 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 09:27:25,000 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 518 flow [2022-12-13 09:27:25,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2022-12-13 09:27:25,001 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2022-12-13 09:27:25,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:25,002 INFO L89 Accepts]: Start accepts. Operand has 65 places, 71 transitions, 518 flow [2022-12-13 09:27:25,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:25,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:25,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 71 transitions, 518 flow [2022-12-13 09:27:25,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 71 transitions, 518 flow [2022-12-13 09:27:25,129 INFO L130 PetriNetUnfolder]: 794/1981 cut-off events. [2022-12-13 09:27:25,130 INFO L131 PetriNetUnfolder]: For 2048/2235 co-relation queries the response was YES. [2022-12-13 09:27:25,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5481 conditions, 1981 events. 794/1981 cut-off events. For 2048/2235 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 17684 event pairs, 144 based on Foata normal form. 15/1134 useless extension candidates. Maximal degree in co-relation 5456. Up to 1405 conditions per place. [2022-12-13 09:27:25,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 71 transitions, 518 flow [2022-12-13 09:27:25,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-13 09:27:25,167 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:25,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 09:27:25,168 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 518 flow [2022-12-13 09:27:25,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:25,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:25,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:27:25,168 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1213926278, now seen corresponding path program 1 times [2022-12-13 09:27:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65666708] [2022-12-13 09:27:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:25,398 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:27:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:25,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65666708] [2022-12-13 09:27:25,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65666708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:25,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:25,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:27:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765160569] [2022-12-13 09:27:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:25,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:27:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:27:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:27:25,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:27:25,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:25,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:25,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:27:25,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:25,713 INFO L130 PetriNetUnfolder]: 1560/2971 cut-off events. [2022-12-13 09:27:25,713 INFO L131 PetriNetUnfolder]: For 4905/4971 co-relation queries the response was YES. [2022-12-13 09:27:25,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 2971 events. 1560/2971 cut-off events. For 4905/4971 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19907 event pairs, 116 based on Foata normal form. 380/2267 useless extension candidates. Maximal degree in co-relation 10555. Up to 1207 conditions per place. [2022-12-13 09:27:25,728 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 46 selfloop transitions, 28 changer transitions 14/100 dead transitions. [2022-12-13 09:27:25,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 882 flow [2022-12-13 09:27:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:27:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:27:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 09:27:25,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2022-12-13 09:27:25,733 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 518 flow. Second operand 5 states and 104 transitions. [2022-12-13 09:27:25,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 882 flow [2022-12-13 09:27:25,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 850 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 09:27:25,743 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 491 flow [2022-12-13 09:27:25,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2022-12-13 09:27:25,744 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2022-12-13 09:27:25,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:25,744 INFO L89 Accepts]: Start accepts. Operand has 68 places, 62 transitions, 491 flow [2022-12-13 09:27:25,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:25,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:25,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 62 transitions, 491 flow [2022-12-13 09:27:25,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 491 flow [2022-12-13 09:27:25,782 INFO L130 PetriNetUnfolder]: 208/567 cut-off events. [2022-12-13 09:27:25,782 INFO L131 PetriNetUnfolder]: For 481/694 co-relation queries the response was YES. [2022-12-13 09:27:25,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 567 events. 208/567 cut-off events. For 481/694 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 3811 event pairs, 0 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 2038. Up to 397 conditions per place. [2022-12-13 09:27:25,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 491 flow [2022-12-13 09:27:25,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-13 09:27:26,274 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:27:26,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 531 [2022-12-13 09:27:26,276 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 487 flow [2022-12-13 09:27:26,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:27:26,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:26,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:26,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:27:26,276 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2051321045, now seen corresponding path program 1 times [2022-12-13 09:27:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:26,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891185620] [2022-12-13 09:27:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:26,978 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:27:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:26,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891185620] [2022-12-13 09:27:26,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891185620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:26,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:26,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:27:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187358653] [2022-12-13 09:27:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:26,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:27:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:27:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:27:26,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2022-12-13 09:27:26,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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:27:26,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:26,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2022-12-13 09:27:26,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:27,289 INFO L130 PetriNetUnfolder]: 1081/1965 cut-off events. [2022-12-13 09:27:27,289 INFO L131 PetriNetUnfolder]: For 4816/4970 co-relation queries the response was YES. [2022-12-13 09:27:27,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8500 conditions, 1965 events. 1081/1965 cut-off events. For 4816/4970 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 12379 event pairs, 119 based on Foata normal form. 117/1597 useless extension candidates. Maximal degree in co-relation 8471. Up to 1109 conditions per place. [2022-12-13 09:27:27,306 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 59 selfloop transitions, 4 changer transitions 49/133 dead transitions. [2022-12-13 09:27:27,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 1234 flow [2022-12-13 09:27:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:27:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:27:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-13 09:27:27,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:27:27,308 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 487 flow. Second operand 6 states and 120 transitions. [2022-12-13 09:27:27,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 1234 flow [2022-12-13 09:27:27,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 133 transitions, 997 flow, removed 42 selfloop flow, removed 8 redundant places. [2022-12-13 09:27:27,340 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 394 flow [2022-12-13 09:27:27,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2022-12-13 09:27:27,341 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2022-12-13 09:27:27,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:27,342 INFO L89 Accepts]: Start accepts. Operand has 64 places, 60 transitions, 394 flow [2022-12-13 09:27:27,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:27,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:27,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 60 transitions, 394 flow [2022-12-13 09:27:27,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 394 flow [2022-12-13 09:27:27,374 INFO L130 PetriNetUnfolder]: 217/489 cut-off events. [2022-12-13 09:27:27,374 INFO L131 PetriNetUnfolder]: For 915/996 co-relation queries the response was YES. [2022-12-13 09:27:27,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 489 events. 217/489 cut-off events. For 915/996 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 2879 event pairs, 0 based on Foata normal form. 6/212 useless extension candidates. Maximal degree in co-relation 1460. Up to 226 conditions per place. [2022-12-13 09:27:27,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 60 transitions, 394 flow [2022-12-13 09:27:27,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-13 09:27:27,809 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:27:27,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 469 [2022-12-13 09:27:27,810 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 401 flow [2022-12-13 09:27:27,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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:27:27,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:27,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:27,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:27:27,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash -226150789, now seen corresponding path program 1 times [2022-12-13 09:27:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914320402] [2022-12-13 09:27:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:27:27,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:27:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:27:27,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:27:27,993 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:27:27,993 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:27:27,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:27:27,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:27:27,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:27:27,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:27:27,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:27:27,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:27:27,997 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:28,005 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:27:28,005 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:27:28,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:27:28 BasicIcfg [2022-12-13 09:27:28,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:27:28,088 INFO L158 Benchmark]: Toolchain (without parser) took 19029.85ms. Allocated memory was 189.8MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 165.2MB in the beginning and 877.2MB in the end (delta: -711.9MB). Peak memory consumption was 167.8MB. Max. memory is 8.0GB. [2022-12-13 09:27:28,088 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 189.8MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:27:28,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.58ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 138.5MB in the end (delta: 26.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:27:28,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.05ms. Allocated memory is still 189.8MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:27:28,089 INFO L158 Benchmark]: Boogie Preprocessor took 53.80ms. Allocated memory is still 189.8MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:27:28,089 INFO L158 Benchmark]: RCFGBuilder took 708.92ms. Allocated memory is still 189.8MB. Free memory was 133.8MB in the beginning and 100.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 09:27:28,089 INFO L158 Benchmark]: TraceAbstraction took 17599.82ms. Allocated memory was 189.8MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 99.2MB in the beginning and 877.2MB in the end (delta: -778.0MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2022-12-13 09:27:28,091 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.16ms. Allocated memory is still 189.8MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 588.58ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 138.5MB in the end (delta: 26.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.05ms. Allocated memory is still 189.8MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.80ms. Allocated memory is still 189.8MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 708.92ms. Allocated memory is still 189.8MB. Free memory was 133.8MB in the beginning and 100.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17599.82ms. Allocated memory was 189.8MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 99.2MB in the beginning and 877.2MB in the end (delta: -778.0MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 116 PlacesBefore, 77 PlacesAfterwards, 108 TransitionsBefore, 67 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 43 ConcurrentYvCompositions, 6 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5196, independent: 4927, independent conditional: 4927, independent unconditional: 0, dependent: 269, dependent conditional: 269, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2627, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2627, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2627, independent: 2483, independent conditional: 0, independent unconditional: 2483, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 144, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 446, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5196, independent: 2373, independent conditional: 2373, independent unconditional: 0, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 2627, unknown conditional: 2627, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2631, Positive cache size: 2558, Positive conditional cache size: 2558, Positive unconditional cache size: 0, Negative cache size: 73, Negative conditional cache size: 73, 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.2s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 324, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277, independent: 248, independent conditional: 21, independent unconditional: 227, dependent: 29, dependent conditional: 5, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 277, independent: 248, independent conditional: 21, independent unconditional: 227, dependent: 29, dependent conditional: 5, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 277, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 29, dependent conditional: 5, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 127, dependent conditional: 32, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 324, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 277, unknown conditional: 277, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 248, Positive conditional cache size: 248, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, 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, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 223, independent conditional: 223, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 91, independent conditional: 22, independent unconditional: 69, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 95, independent: 91, independent conditional: 22, independent unconditional: 69, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 95, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 95, unknown conditional: 95, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 339, Positive conditional cache size: 339, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, 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, 49 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 235, independent conditional: 235, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 67, independent conditional: 31, independent unconditional: 36, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, independent: 67, independent conditional: 31, independent unconditional: 36, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 263, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 68, unknown conditional: 68, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 440, Positive cache size: 406, Positive conditional cache size: 406, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, 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, 53 TransitionsBefore, 53 TransitionsAfterwards, 942 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 307, independent: 273, independent conditional: 273, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 56, independent conditional: 32, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, independent: 56, independent conditional: 32, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, independent: 217, independent conditional: 217, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 57, unknown conditional: 57, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 462, Positive conditional cache size: 462, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, 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, 53 TransitionsBefore, 53 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 304, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 8, independent unconditional: 9, 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: 17, independent: 17, independent conditional: 8, independent unconditional: 9, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 304, independent: 249, independent conditional: 249, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 479, Positive conditional cache size: 479, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, 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, 62 TransitionsBefore, 62 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 176, independent conditional: 176, independent unconditional: 0, dependent: 36, dependent conditional: 36, 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: 212, independent: 176, independent conditional: 176, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 479, Positive conditional cache size: 479, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, 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, 64 PlacesBefore, 64 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1080 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 8, independent unconditional: 2, 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: 12, independent: 10, independent conditional: 8, independent unconditional: 2, 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: 12, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 489, Positive conditional cache size: 489, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, 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, 65 PlacesBefore, 65 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 253, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 253, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 497, Positive conditional cache size: 497, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, 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.5s, 67 PlacesBefore, 65 PlacesAfterwards, 62 TransitionsBefore, 60 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 296, independent: 222, independent conditional: 222, independent unconditional: 0, dependent: 74, dependent conditional: 74, 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: 296, independent: 220, independent conditional: 220, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 499, Positive conditional cache size: 499, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, 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, 63 PlacesBefore, 63 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 378, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 71, independent conditional: 65, independent unconditional: 6, 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: 71, independent: 71, independent conditional: 65, independent unconditional: 6, 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: 71, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 378, independent: 263, independent conditional: 263, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 71, unknown conditional: 71, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 570, Positive conditional cache size: 570, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool a$flush_delayed; [L717] 0 int a$mem_tmp; [L718] 0 _Bool a$r_buff0_thd0; [L719] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd2; [L721] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1193; [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1193, ((void *)0), P0, ((void *)0))=-2, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1194, ((void *)0), P1, ((void *)0))=-1, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1195; [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1195, ((void *)0), P2, ((void *)0))=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 y = 2 [L797] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 842]: 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, 140 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: 17.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 827 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 17 mSDtfsCounter, 827 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:27:28,127 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...