/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:17:17,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:17:17,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:17:17,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:17:17,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:17:17,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:17:18,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:17:18,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:17:18,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:17:18,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:17:18,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:17:18,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:17:18,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:17:18,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:17:18,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:17:18,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:17:18,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:17:18,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:17:18,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:17:18,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:17:18,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:17:18,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:17:18,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:17:18,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:17:18,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:17:18,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:17:18,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:17:18,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:17:18,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:17:18,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:17:18,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:17:18,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:17:18,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:17:18,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:17:18,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:17:18,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:17:18,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:17:18,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:17:18,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:17:18,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:17:18,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:17:18,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:17:18,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:17:18,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:17:18,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:17:18,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:17:18,044 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:17:18,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:17:18,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:17:18,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:17:18,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:17:18,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:17:18,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:17:18,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:17:18,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:17:18,047 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-06 06:17:18,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:17:18,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:17:18,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:17:18,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:17:18,309 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:17:18,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2022-12-06 06:17:19,423 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:17:19,647 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:17:19,648 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2022-12-06 06:17:19,669 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfca6f9d/191989383cab452abe747ed227c68f61/FLAG3d71460b6 [2022-12-06 06:17:19,690 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfca6f9d/191989383cab452abe747ed227c68f61 [2022-12-06 06:17:19,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:17:19,693 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:17:19,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:17:19,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:17:19,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:17:19,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:17:19" (1/1) ... [2022-12-06 06:17:19,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb024a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:19, skipping insertion in model container [2022-12-06 06:17:19,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:17:19" (1/1) ... [2022-12-06 06:17:19,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:17:19,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:17:19,861 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/mix007.opt.i[944,957] [2022-12-06 06:17:20,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:17:20,123 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:17:20,133 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/mix007.opt.i[944,957] [2022-12-06 06:17:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:17:20,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:17:20,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:17:20,229 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:17:20,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20 WrapperNode [2022-12-06 06:17:20,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:17:20,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:17:20,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:17:20,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:17:20,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,302 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-06 06:17:20,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:17:20,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:17:20,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:17:20,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:17:20,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:17:20,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:17:20,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:17:20,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:17:20,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (1/1) ... [2022-12-06 06:17:20,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:17:20,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:17:20,408 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-06 06:17:20,479 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-06 06:17:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:17:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:17:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:17:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:17:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:17:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:17:20,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:17:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:17:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:17:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:17:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:17:20,510 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:17:20,631 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:17:20,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:17:20,875 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:17:20,980 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:17:20,981 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:17:20,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:17:20 BoogieIcfgContainer [2022-12-06 06:17:20,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:17:20,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:17:20,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:17:20,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:17:20,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:17:19" (1/3) ... [2022-12-06 06:17:20,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f22918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:17:20, skipping insertion in model container [2022-12-06 06:17:20,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:17:20" (2/3) ... [2022-12-06 06:17:20,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f22918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:17:20, skipping insertion in model container [2022-12-06 06:17:20,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:17:20" (3/3) ... [2022-12-06 06:17:20,991 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2022-12-06 06:17:21,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:17:21,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:17:21,006 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:17:21,089 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:17:21,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:17:21,195 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:17:21,196 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:17:21,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 06:17:21,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:17:21,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 06:17:21,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:21,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:17:21,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 06:17:21,253 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:17:21,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:17:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 06:17:21,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:17:21,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-06 06:17:25,914 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 06:17:25,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:17:25,929 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;@3635b742, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:17:25,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:17:25,933 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:17:25,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:17:25,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:25,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:25,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash -393038656, now seen corresponding path program 1 times [2022-12-06 06:17:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:25,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140440745] [2022-12-06 06:17:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:26,270 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-06 06:17:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140440745] [2022-12-06 06:17:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140440745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:26,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:26,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:17:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462086411] [2022-12-06 06:17:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:26,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:17:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:17:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:17:26,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:17:26,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 06:17:26,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:26,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:17:26,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:26,765 INFO L130 PetriNetUnfolder]: 3113/4519 cut-off events. [2022-12-06 06:17:26,766 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:17:26,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8913 conditions, 4519 events. 3113/4519 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24159 event pairs, 593 based on Foata normal form. 0/4146 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2022-12-06 06:17:26,791 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-06 06:17:26,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-12-06 06:17:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 06:17:26,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-06 06:17:26,800 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-06 06:17:26,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-12-06 06:17:26,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:17:26,805 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2022-12-06 06:17:26,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-06 06:17:26,809 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:17:26,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:26,809 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 64 flow [2022-12-06 06:17:26,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:26,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:26,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 64 flow [2022-12-06 06:17:26,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-06 06:17:26,816 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-06 06:17:26,816 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:17:26,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:17:26,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-06 06:17:26,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 06:17:26,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:26,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 06:17:26,909 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 06:17:26,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 06:17:26,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:26,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:26,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:17:26,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash 246988925, now seen corresponding path program 1 times [2022-12-06 06:17:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:26,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577136634] [2022-12-06 06:17:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:27,078 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-06 06:17:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577136634] [2022-12-06 06:17:27,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577136634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:27,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:27,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:17:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023071030] [2022-12-06 06:17:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:27,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:17:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:17:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:17:27,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:17:27,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:27,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:27,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:17:27,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:27,977 INFO L130 PetriNetUnfolder]: 8243/11356 cut-off events. [2022-12-06 06:17:27,977 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2022-12-06 06:17:27,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23454 conditions, 11356 events. 8243/11356 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 55989 event pairs, 2847 based on Foata normal form. 248/11604 useless extension candidates. Maximal degree in co-relation 23444. Up to 8433 conditions per place. [2022-12-06 06:17:28,037 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2022-12-06 06:17:28,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2022-12-06 06:17:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:17:28,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-06 06:17:28,040 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:17:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2022-12-06 06:17:28,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:28,047 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2022-12-06 06:17:28,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 06:17:28,048 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:17:28,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:28,048 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 122 flow [2022-12-06 06:17:28,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:28,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:28,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 122 flow [2022-12-06 06:17:28,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 122 flow [2022-12-06 06:17:28,094 INFO L130 PetriNetUnfolder]: 218/491 cut-off events. [2022-12-06 06:17:28,094 INFO L131 PetriNetUnfolder]: For 52/60 co-relation queries the response was YES. [2022-12-06 06:17:28,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 491 events. 218/491 cut-off events. For 52/60 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2886 event pairs, 106 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 990. Up to 311 conditions per place. [2022-12-06 06:17:28,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 122 flow [2022-12-06 06:17:28,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 06:17:28,115 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:28,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 06:17:28,117 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2022-12-06 06:17:28,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:28,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:28,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:28,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:17:28,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash -933278279, now seen corresponding path program 1 times [2022-12-06 06:17:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:28,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258281006] [2022-12-06 06:17:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:28,318 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-06 06:17:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:28,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258281006] [2022-12-06 06:17:28,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258281006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:28,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:28,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037049116] [2022-12-06 06:17:28,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:28,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:28,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:17:28,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 06:17:28,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:28,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:17:28,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:29,195 INFO L130 PetriNetUnfolder]: 7483/10332 cut-off events. [2022-12-06 06:17:29,195 INFO L131 PetriNetUnfolder]: For 3726/3726 co-relation queries the response was YES. [2022-12-06 06:17:29,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 10332 events. 7483/10332 cut-off events. For 3726/3726 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 50997 event pairs, 1931 based on Foata normal form. 176/10508 useless extension candidates. Maximal degree in co-relation 26396. Up to 5349 conditions per place. [2022-12-06 06:17:29,254 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-06 06:17:29,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 330 flow [2022-12-06 06:17:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 06:17:29,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2022-12-06 06:17:29,258 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 57 transitions. [2022-12-06 06:17:29,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 330 flow [2022-12-06 06:17:29,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:29,286 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 164 flow [2022-12-06 06:17:29,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 06:17:29,287 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2022-12-06 06:17:29,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:29,287 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 164 flow [2022-12-06 06:17:29,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:29,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:29,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 164 flow [2022-12-06 06:17:29,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 164 flow [2022-12-06 06:17:29,311 INFO L130 PetriNetUnfolder]: 149/353 cut-off events. [2022-12-06 06:17:29,312 INFO L131 PetriNetUnfolder]: For 142/173 co-relation queries the response was YES. [2022-12-06 06:17:29,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 353 events. 149/353 cut-off events. For 142/173 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1922 event pairs, 57 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 827. Up to 220 conditions per place. [2022-12-06 06:17:29,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 164 flow [2022-12-06 06:17:29,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 06:17:29,322 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:29,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:17:29,323 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 164 flow [2022-12-06 06:17:29,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 06:17:29,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:29,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:29,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:17:29,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -509808059, now seen corresponding path program 1 times [2022-12-06 06:17:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:29,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243637295] [2022-12-06 06:17:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:29,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:29,443 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-06 06:17:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:29,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243637295] [2022-12-06 06:17:29,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243637295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:29,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:29,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:17:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922141654] [2022-12-06 06:17:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:29,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:17:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:17:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:17:29,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 06:17:29,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-06 06:17:29,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:29,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 06:17:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:30,012 INFO L130 PetriNetUnfolder]: 4708/7003 cut-off events. [2022-12-06 06:17:30,013 INFO L131 PetriNetUnfolder]: For 3478/3826 co-relation queries the response was YES. [2022-12-06 06:17:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17362 conditions, 7003 events. 4708/7003 cut-off events. For 3478/3826 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 39331 event pairs, 1617 based on Foata normal form. 120/6965 useless extension candidates. Maximal degree in co-relation 17347. Up to 4109 conditions per place. [2022-12-06 06:17:30,056 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 33 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2022-12-06 06:17:30,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 272 flow [2022-12-06 06:17:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 06:17:30,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 06:17:30,059 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 164 flow. Second operand 3 states and 44 transitions. [2022-12-06 06:17:30,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 272 flow [2022-12-06 06:17:30,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:30,065 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 175 flow [2022-12-06 06:17:30,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-06 06:17:30,067 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2022-12-06 06:17:30,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:30,067 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 175 flow [2022-12-06 06:17:30,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:30,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:30,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 175 flow [2022-12-06 06:17:30,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 175 flow [2022-12-06 06:17:30,091 INFO L130 PetriNetUnfolder]: 125/306 cut-off events. [2022-12-06 06:17:30,091 INFO L131 PetriNetUnfolder]: For 161/169 co-relation queries the response was YES. [2022-12-06 06:17:30,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 306 events. 125/306 cut-off events. For 161/169 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1536 event pairs, 36 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 774. Up to 188 conditions per place. [2022-12-06 06:17:30,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 175 flow [2022-12-06 06:17:30,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 06:17:30,097 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:30,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:17:30,104 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 175 flow [2022-12-06 06:17:30,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-06 06:17:30,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:30,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:30,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:17:30,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash -173135712, now seen corresponding path program 1 times [2022-12-06 06:17:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142617478] [2022-12-06 06:17:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:30,271 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-06 06:17:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:30,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142617478] [2022-12-06 06:17:30,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142617478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:30,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:30,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752054797] [2022-12-06 06:17:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:30,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:17:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:17:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:17:30,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 06:17:30,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-06 06:17:30,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:30,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 06:17:30,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:30,753 INFO L130 PetriNetUnfolder]: 3424/5161 cut-off events. [2022-12-06 06:17:30,753 INFO L131 PetriNetUnfolder]: For 3458/3681 co-relation queries the response was YES. [2022-12-06 06:17:30,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 5161 events. 3424/5161 cut-off events. For 3458/3681 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 29067 event pairs, 773 based on Foata normal form. 125/5064 useless extension candidates. Maximal degree in co-relation 13310. Up to 4413 conditions per place. [2022-12-06 06:17:30,779 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 42 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-06 06:17:30,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 350 flow [2022-12-06 06:17:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:17:30,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:17:30,782 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 175 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:17:30,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 350 flow [2022-12-06 06:17:30,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:30,787 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 200 flow [2022-12-06 06:17:30,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-06 06:17:30,789 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-12-06 06:17:30,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:30,789 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 200 flow [2022-12-06 06:17:30,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:30,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:30,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 200 flow [2022-12-06 06:17:30,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 200 flow [2022-12-06 06:17:30,847 INFO L130 PetriNetUnfolder]: 461/1029 cut-off events. [2022-12-06 06:17:30,847 INFO L131 PetriNetUnfolder]: For 304/345 co-relation queries the response was YES. [2022-12-06 06:17:30,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 1029 events. 461/1029 cut-off events. For 304/345 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7206 event pairs, 198 based on Foata normal form. 4/936 useless extension candidates. Maximal degree in co-relation 2306. Up to 576 conditions per place. [2022-12-06 06:17:30,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 200 flow [2022-12-06 06:17:30,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 06:17:30,895 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:30,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 06:17:30,898 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 200 flow [2022-12-06 06:17:30,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-06 06:17:30,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:30,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:30,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:17:30,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash 506898545, now seen corresponding path program 1 times [2022-12-06 06:17:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591366853] [2022-12-06 06:17:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:31,084 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-06 06:17:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:31,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591366853] [2022-12-06 06:17:31,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591366853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:31,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:31,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870233691] [2022-12-06 06:17:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:31,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:31,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:31,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:31,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:31,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 06:17:31,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:31,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:31,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 06:17:31,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:31,356 INFO L130 PetriNetUnfolder]: 1896/3056 cut-off events. [2022-12-06 06:17:31,356 INFO L131 PetriNetUnfolder]: For 1858/2020 co-relation queries the response was YES. [2022-12-06 06:17:31,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9189 conditions, 3056 events. 1896/3056 cut-off events. For 1858/2020 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16892 event pairs, 307 based on Foata normal form. 267/3211 useless extension candidates. Maximal degree in co-relation 9171. Up to 1568 conditions per place. [2022-12-06 06:17:31,378 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 57 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2022-12-06 06:17:31,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 476 flow [2022-12-06 06:17:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 06:17:31,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6826923076923077 [2022-12-06 06:17:31,379 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 200 flow. Second operand 4 states and 71 transitions. [2022-12-06 06:17:31,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 476 flow [2022-12-06 06:17:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:31,383 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 247 flow [2022-12-06 06:17:31,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-06 06:17:31,383 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2022-12-06 06:17:31,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:31,384 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 247 flow [2022-12-06 06:17:31,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:31,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:31,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 247 flow [2022-12-06 06:17:31,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 247 flow [2022-12-06 06:17:31,426 INFO L130 PetriNetUnfolder]: 286/705 cut-off events. [2022-12-06 06:17:31,426 INFO L131 PetriNetUnfolder]: For 405/639 co-relation queries the response was YES. [2022-12-06 06:17:31,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 705 events. 286/705 cut-off events. For 405/639 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4600 event pairs, 65 based on Foata normal form. 26/696 useless extension candidates. Maximal degree in co-relation 2040. Up to 384 conditions per place. [2022-12-06 06:17:31,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 247 flow [2022-12-06 06:17:31,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-06 06:17:31,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:31,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:17:31,439 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 247 flow [2022-12-06 06:17:31,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:31,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:31,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:31,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:17:31,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -544024048, now seen corresponding path program 1 times [2022-12-06 06:17:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364434717] [2022-12-06 06:17:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:31,610 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-06 06:17:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:31,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364434717] [2022-12-06 06:17:31,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364434717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:31,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:31,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654956148] [2022-12-06 06:17:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:31,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:31,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:31,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:31,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:31,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 06:17:31,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-06 06:17:31,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:31,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 06:17:31,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:32,063 INFO L130 PetriNetUnfolder]: 2925/4753 cut-off events. [2022-12-06 06:17:32,063 INFO L131 PetriNetUnfolder]: For 6328/6447 co-relation queries the response was YES. [2022-12-06 06:17:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16528 conditions, 4753 events. 2925/4753 cut-off events. For 6328/6447 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 28227 event pairs, 792 based on Foata normal form. 62/4751 useless extension candidates. Maximal degree in co-relation 16508. Up to 2370 conditions per place. [2022-12-06 06:17:32,100 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 65 selfloop transitions, 3 changer transitions 22/98 dead transitions. [2022-12-06 06:17:32,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 700 flow [2022-12-06 06:17:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 06:17:32,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-06 06:17:32,101 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 247 flow. Second operand 4 states and 68 transitions. [2022-12-06 06:17:32,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 700 flow [2022-12-06 06:17:32,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 654 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:32,109 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 250 flow [2022-12-06 06:17:32,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-06 06:17:32,109 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2022-12-06 06:17:32,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:32,110 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 250 flow [2022-12-06 06:17:32,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:32,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:32,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 250 flow [2022-12-06 06:17:32,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 250 flow [2022-12-06 06:17:32,183 INFO L130 PetriNetUnfolder]: 457/1132 cut-off events. [2022-12-06 06:17:32,183 INFO L131 PetriNetUnfolder]: For 733/920 co-relation queries the response was YES. [2022-12-06 06:17:32,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 1132 events. 457/1132 cut-off events. For 733/920 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8375 event pairs, 120 based on Foata normal form. 47/1128 useless extension candidates. Maximal degree in co-relation 3018. Up to 613 conditions per place. [2022-12-06 06:17:32,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 250 flow [2022-12-06 06:17:32,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 06:17:32,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:32,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 06:17:32,224 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 253 flow [2022-12-06 06:17:32,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-06 06:17:32,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:32,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:32,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:17:32,224 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:32,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash 556447400, now seen corresponding path program 2 times [2022-12-06 06:17:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:32,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011778077] [2022-12-06 06:17:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:32,350 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-06 06:17:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:32,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011778077] [2022-12-06 06:17:32,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011778077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:32,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:32,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167800209] [2022-12-06 06:17:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:32,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:17:32,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-06 06:17:32,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:32,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:17:32,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:32,664 INFO L130 PetriNetUnfolder]: 1862/3039 cut-off events. [2022-12-06 06:17:32,664 INFO L131 PetriNetUnfolder]: For 3556/3952 co-relation queries the response was YES. [2022-12-06 06:17:32,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 3039 events. 1862/3039 cut-off events. For 3556/3952 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17533 event pairs, 306 based on Foata normal form. 358/3256 useless extension candidates. Maximal degree in co-relation 9876. Up to 1054 conditions per place. [2022-12-06 06:17:32,679 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 70 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2022-12-06 06:17:32,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 628 flow [2022-12-06 06:17:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:17:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:17:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 06:17:32,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2022-12-06 06:17:32,680 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 253 flow. Second operand 5 states and 89 transitions. [2022-12-06 06:17:32,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 628 flow [2022-12-06 06:17:32,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:32,684 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 319 flow [2022-12-06 06:17:32,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-06 06:17:32,685 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2022-12-06 06:17:32,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:32,685 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 319 flow [2022-12-06 06:17:32,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:32,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:32,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 319 flow [2022-12-06 06:17:32,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 319 flow [2022-12-06 06:17:32,727 INFO L130 PetriNetUnfolder]: 316/764 cut-off events. [2022-12-06 06:17:32,728 INFO L131 PetriNetUnfolder]: For 1125/1369 co-relation queries the response was YES. [2022-12-06 06:17:32,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 764 events. 316/764 cut-off events. For 1125/1369 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4924 event pairs, 53 based on Foata normal form. 63/788 useless extension candidates. Maximal degree in co-relation 2596. Up to 378 conditions per place. [2022-12-06 06:17:32,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 319 flow [2022-12-06 06:17:32,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-06 06:17:32,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:32,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 06:17:32,746 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 319 flow [2022-12-06 06:17:32,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-06 06:17:32,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:32,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:32,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:17:32,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:32,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1399814334, now seen corresponding path program 1 times [2022-12-06 06:17:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:32,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505331268] [2022-12-06 06:17:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:32,921 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-06 06:17:32,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:32,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505331268] [2022-12-06 06:17:32,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505331268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:32,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:32,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:17:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735438045] [2022-12-06 06:17:32,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:32,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:17:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:17:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:17:32,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:17:32,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-06 06:17:32,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:32,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:17:32,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:33,211 INFO L130 PetriNetUnfolder]: 1770/2834 cut-off events. [2022-12-06 06:17:33,211 INFO L131 PetriNetUnfolder]: For 4845/5271 co-relation queries the response was YES. [2022-12-06 06:17:33,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 2834 events. 1770/2834 cut-off events. For 4845/5271 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 16122 event pairs, 296 based on Foata normal form. 218/2912 useless extension candidates. Maximal degree in co-relation 10452. Up to 1054 conditions per place. [2022-12-06 06:17:33,225 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 63 selfloop transitions, 17 changer transitions 5/94 dead transitions. [2022-12-06 06:17:33,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 667 flow [2022-12-06 06:17:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 06:17:33,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2022-12-06 06:17:33,227 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 319 flow. Second operand 6 states and 93 transitions. [2022-12-06 06:17:33,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 667 flow [2022-12-06 06:17:33,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 614 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 06:17:33,262 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 292 flow [2022-12-06 06:17:33,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-06 06:17:33,262 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2022-12-06 06:17:33,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:33,263 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 292 flow [2022-12-06 06:17:33,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:33,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:33,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 292 flow [2022-12-06 06:17:33,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 292 flow [2022-12-06 06:17:33,285 INFO L130 PetriNetUnfolder]: 159/381 cut-off events. [2022-12-06 06:17:33,285 INFO L131 PetriNetUnfolder]: For 545/594 co-relation queries the response was YES. [2022-12-06 06:17:33,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 381 events. 159/381 cut-off events. For 545/594 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2062 event pairs, 20 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1252. Up to 119 conditions per place. [2022-12-06 06:17:33,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 47 transitions, 292 flow [2022-12-06 06:17:33,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-06 06:17:33,611 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:17:33,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 06:17:33,612 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 288 flow [2022-12-06 06:17:33,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-06 06:17:33,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:33,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:33,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:17:33,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1832144737, now seen corresponding path program 1 times [2022-12-06 06:17:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244649318] [2022-12-06 06:17:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:33,777 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-06 06:17:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:33,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244649318] [2022-12-06 06:17:33,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244649318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:33,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:33,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703048018] [2022-12-06 06:17:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:33,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:33,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:33,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:33,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:17:33,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-06 06:17:33,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:33,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:17:33,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:34,057 INFO L130 PetriNetUnfolder]: 1450/2393 cut-off events. [2022-12-06 06:17:34,057 INFO L131 PetriNetUnfolder]: For 5852/5895 co-relation queries the response was YES. [2022-12-06 06:17:34,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9439 conditions, 2393 events. 1450/2393 cut-off events. For 5852/5895 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12900 event pairs, 316 based on Foata normal form. 9/2382 useless extension candidates. Maximal degree in co-relation 9419. Up to 1341 conditions per place. [2022-12-06 06:17:34,070 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 40 selfloop transitions, 1 changer transitions 52/96 dead transitions. [2022-12-06 06:17:34,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 813 flow [2022-12-06 06:17:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 06:17:34,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-06 06:17:34,072 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 288 flow. Second operand 4 states and 57 transitions. [2022-12-06 06:17:34,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 813 flow [2022-12-06 06:17:34,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 698 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:17:34,100 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 213 flow [2022-12-06 06:17:34,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2022-12-06 06:17:34,101 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2022-12-06 06:17:34,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:34,101 INFO L89 Accepts]: Start accepts. Operand has 53 places, 40 transitions, 213 flow [2022-12-06 06:17:34,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:34,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:34,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 40 transitions, 213 flow [2022-12-06 06:17:34,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 213 flow [2022-12-06 06:17:34,125 INFO L130 PetriNetUnfolder]: 120/316 cut-off events. [2022-12-06 06:17:34,126 INFO L131 PetriNetUnfolder]: For 366/408 co-relation queries the response was YES. [2022-12-06 06:17:34,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 316 events. 120/316 cut-off events. For 366/408 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1767 event pairs, 18 based on Foata normal form. 19/318 useless extension candidates. Maximal degree in co-relation 917. Up to 94 conditions per place. [2022-12-06 06:17:34,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 213 flow [2022-12-06 06:17:34,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 06:17:34,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:34,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:17:34,150 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 211 flow [2022-12-06 06:17:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-06 06:17:34,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:34,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:34,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:17:34,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -822237822, now seen corresponding path program 1 times [2022-12-06 06:17:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:34,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732934910] [2022-12-06 06:17:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:34,314 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-06 06:17:34,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732934910] [2022-12-06 06:17:34,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732934910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:34,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:34,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:34,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374208635] [2022-12-06 06:17:34,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:34,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:34,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:34,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:34,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:17:34,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 211 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 06:17:34,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:34,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:17:34,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:34,536 INFO L130 PetriNetUnfolder]: 934/1616 cut-off events. [2022-12-06 06:17:34,536 INFO L131 PetriNetUnfolder]: For 2812/2812 co-relation queries the response was YES. [2022-12-06 06:17:34,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6078 conditions, 1616 events. 934/1616 cut-off events. For 2812/2812 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8784 event pairs, 150 based on Foata normal form. 2/1618 useless extension candidates. Maximal degree in co-relation 6057. Up to 740 conditions per place. [2022-12-06 06:17:34,543 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 40 selfloop transitions, 4 changer transitions 46/90 dead transitions. [2022-12-06 06:17:34,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 635 flow [2022-12-06 06:17:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:17:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:17:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:17:34,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2022-12-06 06:17:34,544 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 211 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:17:34,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 90 transitions, 635 flow [2022-12-06 06:17:34,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 632 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:34,560 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 192 flow [2022-12-06 06:17:34,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2022-12-06 06:17:34,561 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2022-12-06 06:17:34,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:34,561 INFO L89 Accepts]: Start accepts. Operand has 55 places, 34 transitions, 192 flow [2022-12-06 06:17:34,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:34,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:34,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 34 transitions, 192 flow [2022-12-06 06:17:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 34 transitions, 192 flow [2022-12-06 06:17:34,571 INFO L130 PetriNetUnfolder]: 33/102 cut-off events. [2022-12-06 06:17:34,571 INFO L131 PetriNetUnfolder]: For 134/160 co-relation queries the response was YES. [2022-12-06 06:17:34,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 102 events. 33/102 cut-off events. For 134/160 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 378 event pairs, 3 based on Foata normal form. 11/107 useless extension candidates. Maximal degree in co-relation 300. Up to 32 conditions per place. [2022-12-06 06:17:34,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 34 transitions, 192 flow [2022-12-06 06:17:34,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 06:17:34,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L773: Formula: (and (= v_~y~0_100 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_19| v_P1Thread1of1ForFork3_~arg.base_19) (= v_~x~0_57 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_19| v_P1Thread1of1ForFork3_~arg.offset_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_19|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_19|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_19, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_19|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_19|, ~y~0=v_~y~0_100, ~x~0=v_~x~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~y~0, ~x~0] and [478] $Ultimate##0-->L785: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_16 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] [2022-12-06 06:17:34,956 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:17:34,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 396 [2022-12-06 06:17:34,957 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 186 flow [2022-12-06 06:17:34,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 06:17:34,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:34,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:34,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:17:34,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash 171005573, now seen corresponding path program 1 times [2022-12-06 06:17:34,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:34,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767657246] [2022-12-06 06:17:34,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:34,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:35,672 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-06 06:17:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:35,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767657246] [2022-12-06 06:17:35,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767657246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:35,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:35,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:35,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114022752] [2022-12-06 06:17:35,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:35,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:17:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:17:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:17:35,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:17:35,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 186 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-06 06:17:35,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:35,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:17:35,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:35,822 INFO L130 PetriNetUnfolder]: 148/289 cut-off events. [2022-12-06 06:17:35,822 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-06 06:17:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 289 events. 148/289 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 20 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 1139. Up to 106 conditions per place. [2022-12-06 06:17:35,823 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 33 selfloop transitions, 3 changer transitions 31/67 dead transitions. [2022-12-06 06:17:35,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 528 flow [2022-12-06 06:17:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 06:17:35,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 06:17:35,824 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 186 flow. Second operand 6 states and 36 transitions. [2022-12-06 06:17:35,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 528 flow [2022-12-06 06:17:35,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 491 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-12-06 06:17:35,827 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 172 flow [2022-12-06 06:17:35,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2022-12-06 06:17:35,828 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2022-12-06 06:17:35,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:35,828 INFO L89 Accepts]: Start accepts. Operand has 49 places, 32 transitions, 172 flow [2022-12-06 06:17:35,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:35,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:35,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 172 flow [2022-12-06 06:17:35,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 32 transitions, 172 flow [2022-12-06 06:17:35,835 INFO L130 PetriNetUnfolder]: 31/89 cut-off events. [2022-12-06 06:17:35,835 INFO L131 PetriNetUnfolder]: For 87/97 co-relation queries the response was YES. [2022-12-06 06:17:35,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 89 events. 31/89 cut-off events. For 87/97 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 299 event pairs, 3 based on Foata normal form. 7/93 useless extension candidates. Maximal degree in co-relation 258. Up to 28 conditions per place. [2022-12-06 06:17:35,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 172 flow [2022-12-06 06:17:35,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-06 06:17:36,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L785: Formula: (and (= |v_P1Thread1of1ForFork3_#in~arg.offset_21| v_P1Thread1of1ForFork3_~arg.offset_21) (= |v_P1Thread1of1ForFork3_#in~arg.base_21| v_P1Thread1of1ForFork3_~arg.base_21) (= v_~x~0_61 1) (= v_~y~0_104 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_21, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_21, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, ~y~0=v_~y~0_104, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|, ~x~0=v_~x~0_61} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P2Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0, ~x~0] and [510] L773-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_169 (+ v_~__unbuffered_cnt~0_170 1)) (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_170} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 06:17:36,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->P1EXIT: Formula: (and (= v_~y~0_108 2) (= |v_P1Thread1of1ForFork3_#res.base_23| 0) (= |v_P1Thread1of1ForFork3_#res.offset_23| 0) (= |v_P1Thread1of1ForFork3_#in~arg.base_23| v_P1Thread1of1ForFork3_~arg.base_23) (= v_~__unbuffered_cnt~0_299 (+ v_~__unbuffered_cnt~0_300 1)) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~x~0_65 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_23| v_P1Thread1of1ForFork3_~arg.offset_23) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_23|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_300, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_23|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_23, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_23|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_23, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_23|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_299, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_23|, ~y~0=v_~y~0_108, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|, ~x~0=v_~x~0_65} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P2Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] and [394] L785-->L788: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 06:17:36,274 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:17:36,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 447 [2022-12-06 06:17:36,275 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 187 flow [2022-12-06 06:17:36,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-06 06:17:36,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:36,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:36,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:17:36,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash 105378552, now seen corresponding path program 1 times [2022-12-06 06:17:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052763780] [2022-12-06 06:17:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:17:36,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:17:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:17:36,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:17:36,343 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:17:36,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:17:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:17:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:17:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:17:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:17:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:17:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:17:36,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:17:36,345 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:36,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:17:36,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:17:36,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:17:36 BasicIcfg [2022-12-06 06:17:36,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:17:36,401 INFO L158 Benchmark]: Toolchain (without parser) took 16707.36ms. Allocated memory was 221.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 177.4MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 87.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:36,401 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory is still 197.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:17:36,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.97ms. Allocated memory is still 221.2MB. Free memory was 177.4MB in the beginning and 185.8MB in the end (delta: -8.4MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:36,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.05ms. Allocated memory is still 221.2MB. Free memory was 185.8MB in the beginning and 182.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:36,401 INFO L158 Benchmark]: Boogie Preprocessor took 48.10ms. Allocated memory is still 221.2MB. Free memory was 182.8MB in the beginning and 180.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:36,401 INFO L158 Benchmark]: RCFGBuilder took 630.81ms. Allocated memory is still 221.2MB. Free memory was 180.7MB in the beginning and 144.5MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 06:17:36,401 INFO L158 Benchmark]: TraceAbstraction took 15414.09ms. Allocated memory was 221.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 144.0MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2022-12-06 06:17:36,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory is still 197.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 535.97ms. Allocated memory is still 221.2MB. Free memory was 177.4MB in the beginning and 185.8MB in the end (delta: -8.4MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.05ms. Allocated memory is still 221.2MB. Free memory was 185.8MB in the beginning and 182.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.10ms. Allocated memory is still 221.2MB. Free memory was 182.8MB in the beginning and 180.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.81ms. Allocated memory is still 221.2MB. Free memory was 180.7MB in the beginning and 144.5MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15414.09ms. Allocated memory was 221.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 144.0MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2071, independent: 2004, independent conditional: 2004, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2071, independent: 2004, independent conditional: 0, independent unconditional: 2004, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2071, independent: 2004, independent conditional: 0, independent unconditional: 2004, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2071, independent: 2004, independent conditional: 0, independent unconditional: 2004, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1680, independent: 1636, independent conditional: 0, independent unconditional: 1636, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1680, independent: 1614, independent conditional: 0, independent unconditional: 1614, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 195, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2071, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1680, unknown conditional: 0, unknown unconditional: 1680] , Statistics on independence cache: Total cache size (in pairs): 2518, Positive cache size: 2474, Positive conditional cache size: 0, Positive unconditional cache size: 2474, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 161, independent conditional: 9, independent unconditional: 152, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 161, independent conditional: 9, independent unconditional: 152, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 161, independent conditional: 9, independent unconditional: 152, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 169, independent: 148, independent conditional: 9, independent unconditional: 139, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 169, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 81, dependent conditional: 13, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 169, unknown conditional: 11, unknown unconditional: 158] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 148, Positive conditional cache size: 9, Positive unconditional cache size: 139, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 194, independent: 179, independent conditional: 39, independent unconditional: 140, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, independent: 179, independent conditional: 11, independent unconditional: 168, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 194, independent: 179, independent conditional: 11, independent unconditional: 168, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 1, independent unconditional: 13, 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: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 194, independent: 165, independent conditional: 10, independent unconditional: 155, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 15, unknown conditional: 1, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 162, Positive conditional cache size: 10, Positive unconditional cache size: 152, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 295, independent: 274, independent conditional: 274, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 295, independent: 274, independent conditional: 40, independent unconditional: 234, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 295, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 295, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 295, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 170, Positive conditional cache size: 10, Positive unconditional cache size: 160, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 289, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 289, independent: 266, independent conditional: 10, independent unconditional: 256, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 289, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 289, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 289, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 170, Positive conditional cache size: 10, Positive unconditional cache size: 160, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 96, independent conditional: 16, independent unconditional: 80, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 96, independent conditional: 6, independent unconditional: 90, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 96, independent conditional: 6, independent unconditional: 90, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 96, independent conditional: 6, independent unconditional: 90, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 170, Positive conditional cache size: 10, Positive unconditional cache size: 160, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 197, independent conditional: 197, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 197, independent conditional: 44, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 197, independent conditional: 41, independent unconditional: 156, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 197, independent conditional: 41, independent unconditional: 156, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 197, independent conditional: 41, independent unconditional: 156, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 170, Positive conditional cache size: 10, Positive unconditional cache size: 160, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 418, independent: 392, independent conditional: 392, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 418, independent: 392, independent conditional: 104, independent unconditional: 288, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 418, independent: 392, independent conditional: 96, independent unconditional: 296, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 418, independent: 392, independent conditional: 96, independent unconditional: 296, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 418, independent: 384, independent conditional: 96, independent unconditional: 288, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 184, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 43, independent unconditional: 141, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 184, independent conditional: 39, independent unconditional: 145, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 39, independent unconditional: 145, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 184, independent conditional: 39, independent unconditional: 145, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 44 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, independent: 332, independent conditional: 332, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 352, independent: 332, independent conditional: 130, independent unconditional: 202, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 352, independent: 332, independent conditional: 126, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 352, independent: 332, independent conditional: 126, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 352, independent: 331, independent conditional: 125, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 236, Positive conditional cache size: 14, Positive unconditional cache size: 222, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 161, independent conditional: 70, independent unconditional: 91, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 161, independent conditional: 69, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 161, independent conditional: 69, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 161, independent conditional: 69, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 258, Positive conditional cache size: 15, Positive unconditional cache size: 243, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 53 PlacesBefore, 51 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 34, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 58, independent conditional: 20, independent unconditional: 38, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 20, independent unconditional: 38, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 55, independent conditional: 20, independent unconditional: 35, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 288, Positive conditional cache size: 16, Positive unconditional cache size: 272, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 47 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 44, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 409, Positive conditional cache size: 21, Positive unconditional cache size: 388, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t181, ((void *)0), P0, ((void *)0))=-3, t181={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t182, ((void *)0), P1, ((void *)0))=-2, t181={5:0}, t182={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t183, ((void *)0), P2, ((void *)0))=-1, t181={5:0}, t182={6:0}, t183={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t184, ((void *)0), P3, ((void *)0))=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 [L772] 2 y = 1 [L784] 2 y = 2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L787] 2 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 870]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 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: 15.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 871 IncrementalHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 18 mSDtfsCounter, 871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-06 06:17:36,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...