/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/mix047_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:28:37,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:28:37,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:28:37,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:28:37,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:28:37,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:28:37,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:28:37,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:28:37,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:28:37,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:28:37,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:28:37,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:28:37,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:28:37,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:28:37,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:28:37,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:28:37,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:28:37,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:28:37,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:28:37,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:28:37,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:28:37,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:28:37,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:28:37,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:28:37,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:28:37,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:28:37,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:28:37,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:28:37,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:28:37,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:28:37,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:28:37,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:28:37,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:28:37,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:28:37,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:28:37,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:28:37,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:28:37,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:28:37,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:28:37,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:28:37,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:28:37,589 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:28:37,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:28:37,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:28:37,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:28:37,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:28:37,614 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:28:37,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:28:37,614 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:28:37,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:28:37,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:28:37,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:28:37,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:28:37,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:28:37,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:28:37,617 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:28:37,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:28:37,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:28:37,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:28:37,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:28:37,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:28:37,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:28:37,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:28:37,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:28:37,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:28:37,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:28:37,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:28:37,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:28:37,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:28:37,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:28:37,620 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:28:37,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:28:37,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:28:37,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:28:37,986 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:28:37,988 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:28:37,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:28:39,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:28:39,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:28:39,497 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:28:39,514 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a54fd154/91b2cb6fef3940debe4b2dca224f836d/FLAG080a91516 [2022-12-06 06:28:39,529 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a54fd154/91b2cb6fef3940debe4b2dca224f836d [2022-12-06 06:28:39,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:28:39,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:28:39,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:28:39,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:28:39,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:28:39,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:28:39" (1/1) ... [2022-12-06 06:28:39,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d7b0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:39, skipping insertion in model container [2022-12-06 06:28:39,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:28:39" (1/1) ... [2022-12-06 06:28:39,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:28:39,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:28:39,755 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:28:39,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:39,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:39,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:28:40,019 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:28:40,031 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:28:40,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:40,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:40,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:28:40,129 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:28:40,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40 WrapperNode [2022-12-06 06:28:40,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:28:40,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:28:40,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:28:40,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:28:40,139 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:28:40" (1/1) ... [2022-12-06 06:28:40,165 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:28:40" (1/1) ... [2022-12-06 06:28:40,192 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-06 06:28:40,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:28:40,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:28:40,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:28:40,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:28:40,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:28:40,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:28:40,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:28:40,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:28:40,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (1/1) ... [2022-12-06 06:28:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:28:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:28:40,281 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:28:40,283 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:28:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:28:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:28:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:28:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:28:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:28:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:28:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:28:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:28:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:28:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:28:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:28:40,311 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:28:40,443 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:28:40,445 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:28:40,824 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:28:40,963 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:28:40,963 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:28:40,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:28:40 BoogieIcfgContainer [2022-12-06 06:28:40,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:28:40,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:28:40,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:28:40,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:28:40,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:28:39" (1/3) ... [2022-12-06 06:28:40,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622cbdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:28:40, skipping insertion in model container [2022-12-06 06:28:40,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:40" (2/3) ... [2022-12-06 06:28:40,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622cbdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:28:40, skipping insertion in model container [2022-12-06 06:28:40,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:28:40" (3/3) ... [2022-12-06 06:28:40,977 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:28:40,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:28:40,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:28:40,995 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:28:41,059 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:28:41,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 06:28:41,202 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 06:28:41,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:28:41,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 06:28:41,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-06 06:28:41,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:41,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 06:28:41,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-06 06:28:41,281 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 06:28:41,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:41,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:28:41,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 06:28:41,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-06 06:28:45,987 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 06:28:46,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:28:46,006 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;@57ffc517, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:28:46,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:28:46,009 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:28:46,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:46,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:46,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:28:46,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash 546536, now seen corresponding path program 1 times [2022-12-06 06:28:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:46,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914655404] [2022-12-06 06:28:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:46,404 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:28:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914655404] [2022-12-06 06:28:46,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914655404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:46,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:28:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385023670] [2022-12-06 06:28:46,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:46,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:46,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 06:28:46,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 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:28:46,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:46,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 06:28:46,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:47,912 INFO L130 PetriNetUnfolder]: 7234/10434 cut-off events. [2022-12-06 06:28:47,913 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 06:28:47,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20401 conditions, 10434 events. 7234/10434 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 63196 event pairs, 1330 based on Foata normal form. 0/9573 useless extension candidates. Maximal degree in co-relation 20389. Up to 7822 conditions per place. [2022-12-06 06:28:47,987 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 43 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 06:28:47,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 247 flow [2022-12-06 06:28:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 06:28:47,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 06:28:47,999 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 69 transitions. [2022-12-06 06:28:48,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 247 flow [2022-12-06 06:28:48,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:28:48,006 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 06:28:48,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 06:28:48,012 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:28:48,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:48,013 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 06:28:48,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:48,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:48,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 06:28:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:28:48,031 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:28:48,031 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:48,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:28:48,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:28:48,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:28:48,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:28:48,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 06:28:48,180 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 06:28:48,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:28:48,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:48,180 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:48,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:28:48,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1812473208, now seen corresponding path program 1 times [2022-12-06 06:28:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:48,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068020554] [2022-12-06 06:28:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:48,380 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:28:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068020554] [2022-12-06 06:28:48,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068020554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:48,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:48,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:28:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728573800] [2022-12-06 06:28:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:48,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:48,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:28:48,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 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:28:48,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:48,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:28:48,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:50,356 INFO L130 PetriNetUnfolder]: 13530/18448 cut-off events. [2022-12-06 06:28:50,356 INFO L131 PetriNetUnfolder]: For 932/932 co-relation queries the response was YES. [2022-12-06 06:28:50,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38229 conditions, 18448 events. 13530/18448 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 95417 event pairs, 5412 based on Foata normal form. 587/19035 useless extension candidates. Maximal degree in co-relation 38219. Up to 9251 conditions per place. [2022-12-06 06:28:50,512 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2022-12-06 06:28:50,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-06 06:28:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:28:50,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:28:50,514 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:28:50,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-06 06:28:50,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:28:50,516 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 124 flow [2022-12-06 06:28:50,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-06 06:28:50,517 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2022-12-06 06:28:50,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:50,517 INFO L89 Accepts]: Start accepts. Operand has 40 places, 34 transitions, 124 flow [2022-12-06 06:28:50,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:50,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:50,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 124 flow [2022-12-06 06:28:50,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 124 flow [2022-12-06 06:28:50,583 INFO L130 PetriNetUnfolder]: 284/708 cut-off events. [2022-12-06 06:28:50,583 INFO L131 PetriNetUnfolder]: For 92/113 co-relation queries the response was YES. [2022-12-06 06:28:50,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 708 events. 284/708 cut-off events. For 92/113 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4828 event pairs, 114 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 1393. Up to 263 conditions per place. [2022-12-06 06:28:50,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 124 flow [2022-12-06 06:28:50,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 06:28:50,638 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:50,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 06:28:50,640 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 124 flow [2022-12-06 06:28:50,643 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:28:50,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:50,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:50,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:28:50,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash 352094708, now seen corresponding path program 1 times [2022-12-06 06:28:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:50,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239554591] [2022-12-06 06:28:50,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:28:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239554591] [2022-12-06 06:28:50,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239554591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:50,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:50,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:28:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399273325] [2022-12-06 06:28:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:50,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:28:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:28:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:28:50,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:28:50,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 124 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:28:50,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:50,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:28:50,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:52,720 INFO L130 PetriNetUnfolder]: 13208/18015 cut-off events. [2022-12-06 06:28:52,721 INFO L131 PetriNetUnfolder]: For 6874/6874 co-relation queries the response was YES. [2022-12-06 06:28:52,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46391 conditions, 18015 events. 13208/18015 cut-off events. For 6874/6874 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 93721 event pairs, 1386 based on Foata normal form. 45/18060 useless extension candidates. Maximal degree in co-relation 46379. Up to 8772 conditions per place. [2022-12-06 06:28:52,825 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 58 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2022-12-06 06:28:52,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 378 flow [2022-12-06 06:28:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:28:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:28:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:28:52,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2022-12-06 06:28:52,828 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 124 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:28:52,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 378 flow [2022-12-06 06:28:52,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:28:52,855 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 202 flow [2022-12-06 06:28:52,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2022-12-06 06:28:52,857 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:28:52,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:52,857 INFO L89 Accepts]: Start accepts. Operand has 44 places, 42 transitions, 202 flow [2022-12-06 06:28:52,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:52,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:52,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 42 transitions, 202 flow [2022-12-06 06:28:52,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 202 flow [2022-12-06 06:28:52,921 INFO L130 PetriNetUnfolder]: 239/610 cut-off events. [2022-12-06 06:28:52,921 INFO L131 PetriNetUnfolder]: For 413/485 co-relation queries the response was YES. [2022-12-06 06:28:52,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 610 events. 239/610 cut-off events. For 413/485 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3975 event pairs, 71 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 1471. Up to 216 conditions per place. [2022-12-06 06:28:52,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 42 transitions, 202 flow [2022-12-06 06:28:52,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 06:28:52,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:52,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 06:28:52,998 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 202 flow [2022-12-06 06:28:52,998 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:28:52,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:52,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:52,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:28:52,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash 352093034, now seen corresponding path program 1 times [2022-12-06 06:28:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:53,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175687610] [2022-12-06 06:28:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:53,152 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:28:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:53,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175687610] [2022-12-06 06:28:53,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175687610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:53,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:53,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:28:53,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112777688] [2022-12-06 06:28:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:53,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:53,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:53,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:53,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 202 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:28:53,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:53,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:53,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:54,739 INFO L130 PetriNetUnfolder]: 10419/14707 cut-off events. [2022-12-06 06:28:54,739 INFO L131 PetriNetUnfolder]: For 13307/13777 co-relation queries the response was YES. [2022-12-06 06:28:54,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39605 conditions, 14707 events. 10419/14707 cut-off events. For 13307/13777 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 82169 event pairs, 2139 based on Foata normal form. 200/14572 useless extension candidates. Maximal degree in co-relation 39590. Up to 11797 conditions per place. [2022-12-06 06:28:54,859 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 44 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2022-12-06 06:28:54,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 358 flow [2022-12-06 06:28:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:28:54,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:28:54,861 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 202 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:28:54,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 358 flow [2022-12-06 06:28:54,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:28:54,886 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 216 flow [2022-12-06 06:28:54,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-06 06:28:54,887 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-06 06:28:54,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:54,887 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 216 flow [2022-12-06 06:28:54,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:54,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:54,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 216 flow [2022-12-06 06:28:54,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 216 flow [2022-12-06 06:28:54,935 INFO L130 PetriNetUnfolder]: 201/528 cut-off events. [2022-12-06 06:28:54,935 INFO L131 PetriNetUnfolder]: For 489/573 co-relation queries the response was YES. [2022-12-06 06:28:54,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 528 events. 201/528 cut-off events. For 489/573 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3290 event pairs, 45 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 1346. Up to 185 conditions per place. [2022-12-06 06:28:54,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 216 flow [2022-12-06 06:28:54,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 06:28:54,947 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:54,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 06:28:54,948 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 216 flow [2022-12-06 06:28:54,948 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:28:54,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:54,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:28:54,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -230875720, now seen corresponding path program 1 times [2022-12-06 06:28:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:54,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681110367] [2022-12-06 06:28:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:55,117 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:28:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:55,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681110367] [2022-12-06 06:28:55,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681110367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:55,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:55,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:28:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279498190] [2022-12-06 06:28:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:28:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:28:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:28:55,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:28:55,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 216 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:28:55,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:55,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:28:55,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:56,395 INFO L130 PetriNetUnfolder]: 12644/17247 cut-off events. [2022-12-06 06:28:56,395 INFO L131 PetriNetUnfolder]: For 17071/17071 co-relation queries the response was YES. [2022-12-06 06:28:56,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49944 conditions, 17247 events. 12644/17247 cut-off events. For 17071/17071 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 89089 event pairs, 2354 based on Foata normal form. 32/17279 useless extension candidates. Maximal degree in co-relation 49926. Up to 8397 conditions per place. [2022-12-06 06:28:56,513 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 64 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2022-12-06 06:28:56,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 549 flow [2022-12-06 06:28:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:28:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:28:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 06:28:56,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 06:28:56,518 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 216 flow. Second operand 4 states and 69 transitions. [2022-12-06 06:28:56,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 549 flow [2022-12-06 06:28:56,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:28:56,564 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 380 flow [2022-12-06 06:28:56,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-12-06 06:28:56,566 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2022-12-06 06:28:56,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:56,567 INFO L89 Accepts]: Start accepts. Operand has 51 places, 53 transitions, 380 flow [2022-12-06 06:28:56,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:56,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:56,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 53 transitions, 380 flow [2022-12-06 06:28:56,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 380 flow [2022-12-06 06:28:56,611 INFO L130 PetriNetUnfolder]: 183/484 cut-off events. [2022-12-06 06:28:56,612 INFO L131 PetriNetUnfolder]: For 934/1176 co-relation queries the response was YES. [2022-12-06 06:28:56,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 484 events. 183/484 cut-off events. For 934/1176 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2956 event pairs, 18 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 1597. Up to 169 conditions per place. [2022-12-06 06:28:56,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 53 transitions, 380 flow [2022-12-06 06:28:56,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-06 06:28:56,663 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:56,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 06:28:56,665 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 380 flow [2022-12-06 06:28:56,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:28:56,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:56,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:56,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:28:56,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash -939504343, now seen corresponding path program 1 times [2022-12-06 06:28:56,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:56,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942754445] [2022-12-06 06:28:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:56,834 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:28:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942754445] [2022-12-06 06:28:56,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942754445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:56,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:56,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:28:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448735880] [2022-12-06 06:28:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:56,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:56,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 06:28:56,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:28:56,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:56,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 06:28:56,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:58,911 INFO L130 PetriNetUnfolder]: 15000/21204 cut-off events. [2022-12-06 06:28:58,911 INFO L131 PetriNetUnfolder]: For 43305/44510 co-relation queries the response was YES. [2022-12-06 06:28:58,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63593 conditions, 21204 events. 15000/21204 cut-off events. For 43305/44510 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 126024 event pairs, 6196 based on Foata normal form. 677/21786 useless extension candidates. Maximal degree in co-relation 63572. Up to 11532 conditions per place. [2022-12-06 06:28:59,051 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 56 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2022-12-06 06:28:59,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 567 flow [2022-12-06 06:28:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:28:59,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:28:59,053 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 380 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:28:59,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 567 flow [2022-12-06 06:28:59,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 567 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:28:59,144 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 400 flow [2022-12-06 06:28:59,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-12-06 06:28:59,145 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2022-12-06 06:28:59,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:59,145 INFO L89 Accepts]: Start accepts. Operand has 54 places, 53 transitions, 400 flow [2022-12-06 06:28:59,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:59,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:59,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 53 transitions, 400 flow [2022-12-06 06:28:59,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 400 flow [2022-12-06 06:28:59,197 INFO L130 PetriNetUnfolder]: 182/544 cut-off events. [2022-12-06 06:28:59,197 INFO L131 PetriNetUnfolder]: For 1288/1541 co-relation queries the response was YES. [2022-12-06 06:28:59,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 544 events. 182/544 cut-off events. For 1288/1541 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3652 event pairs, 23 based on Foata normal form. 2/541 useless extension candidates. Maximal degree in co-relation 1817. Up to 169 conditions per place. [2022-12-06 06:28:59,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 53 transitions, 400 flow [2022-12-06 06:28:59,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-06 06:28:59,209 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:59,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 06:28:59,210 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 400 flow [2022-12-06 06:28:59,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:28:59,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:59,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:59,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:28:59,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1997988850, now seen corresponding path program 1 times [2022-12-06 06:28:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:59,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664827015] [2022-12-06 06:28:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:59,402 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:28:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664827015] [2022-12-06 06:28:59,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664827015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:59,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:59,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:28:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713373375] [2022-12-06 06:28:59,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:59,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:59,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:59,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:59,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:28:59,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:59,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:59,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:00,735 INFO L130 PetriNetUnfolder]: 8677/13017 cut-off events. [2022-12-06 06:29:00,735 INFO L131 PetriNetUnfolder]: For 29610/30712 co-relation queries the response was YES. [2022-12-06 06:29:00,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38929 conditions, 13017 events. 8677/13017 cut-off events. For 29610/30712 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 80817 event pairs, 1824 based on Foata normal form. 942/13857 useless extension candidates. Maximal degree in co-relation 38906. Up to 10914 conditions per place. [2022-12-06 06:29:00,807 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 67 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2022-12-06 06:29:00,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 748 flow [2022-12-06 06:29:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 06:29:00,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-06 06:29:00,808 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 400 flow. Second operand 3 states and 53 transitions. [2022-12-06 06:29:00,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 748 flow [2022-12-06 06:29:00,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 736 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:29:00,834 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 425 flow [2022-12-06 06:29:00,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-06 06:29:00,834 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2022-12-06 06:29:00,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:00,835 INFO L89 Accepts]: Start accepts. Operand has 56 places, 57 transitions, 425 flow [2022-12-06 06:29:00,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:00,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:00,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 57 transitions, 425 flow [2022-12-06 06:29:00,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 425 flow [2022-12-06 06:29:01,114 INFO L130 PetriNetUnfolder]: 692/1682 cut-off events. [2022-12-06 06:29:01,114 INFO L131 PetriNetUnfolder]: For 2199/2511 co-relation queries the response was YES. [2022-12-06 06:29:01,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 1682 events. 692/1682 cut-off events. For 2199/2511 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 13958 event pairs, 251 based on Foata normal form. 5/1597 useless extension candidates. Maximal degree in co-relation 4423. Up to 908 conditions per place. [2022-12-06 06:29:01,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 57 transitions, 425 flow [2022-12-06 06:29:01,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-06 06:29:01,147 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:01,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-06 06:29:01,148 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 425 flow [2022-12-06 06:29:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:29:01,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:01,148 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:29:01,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:29:01,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1857782074, now seen corresponding path program 1 times [2022-12-06 06:29:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:01,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984077051] [2022-12-06 06:29:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:01,310 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:29:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:01,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984077051] [2022-12-06 06:29:01,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984077051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:01,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:01,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279165568] [2022-12-06 06:29:01,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:01,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:01,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:01,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:29:01,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 425 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:29:01,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:01,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:29:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:03,236 INFO L130 PetriNetUnfolder]: 16181/23381 cut-off events. [2022-12-06 06:29:03,236 INFO L131 PetriNetUnfolder]: For 54414/54414 co-relation queries the response was YES. [2022-12-06 06:29:03,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81093 conditions, 23381 events. 16181/23381 cut-off events. For 54414/54414 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 143036 event pairs, 4958 based on Foata normal form. 168/23549 useless extension candidates. Maximal degree in co-relation 81068. Up to 9951 conditions per place. [2022-12-06 06:29:03,310 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 80 selfloop transitions, 22 changer transitions 6/108 dead transitions. [2022-12-06 06:29:03,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 887 flow [2022-12-06 06:29:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:29:03,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:29:03,312 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 425 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:29:03,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 887 flow [2022-12-06 06:29:03,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 108 transitions, 874 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:29:03,368 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 549 flow [2022-12-06 06:29:03,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-06 06:29:03,370 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2022-12-06 06:29:03,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:03,371 INFO L89 Accepts]: Start accepts. Operand has 61 places, 59 transitions, 549 flow [2022-12-06 06:29:03,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:03,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:03,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 549 flow [2022-12-06 06:29:03,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 549 flow [2022-12-06 06:29:03,518 INFO L130 PetriNetUnfolder]: 936/2140 cut-off events. [2022-12-06 06:29:03,518 INFO L131 PetriNetUnfolder]: For 3347/3759 co-relation queries the response was YES. [2022-12-06 06:29:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5701 conditions, 2140 events. 936/2140 cut-off events. For 3347/3759 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 18053 event pairs, 395 based on Foata normal form. 8/1996 useless extension candidates. Maximal degree in co-relation 5675. Up to 1390 conditions per place. [2022-12-06 06:29:03,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 549 flow [2022-12-06 06:29:03,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-06 06:29:03,553 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:03,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 06:29:03,554 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 549 flow [2022-12-06 06:29:03,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:29:03,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:03,555 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:29:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:29:03,555 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -621275932, now seen corresponding path program 1 times [2022-12-06 06:29:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381847284] [2022-12-06 06:29:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:03,729 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:29:03,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:03,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381847284] [2022-12-06 06:29:03,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381847284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:03,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:03,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709342680] [2022-12-06 06:29:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:03,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:03,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:29:03,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:03,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:03,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:04,915 INFO L130 PetriNetUnfolder]: 6860/10811 cut-off events. [2022-12-06 06:29:04,916 INFO L131 PetriNetUnfolder]: For 32844/33528 co-relation queries the response was YES. [2022-12-06 06:29:04,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36946 conditions, 10811 events. 6860/10811 cut-off events. For 32844/33528 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 71254 event pairs, 1279 based on Foata normal form. 1096/11766 useless extension candidates. Maximal degree in co-relation 36917. Up to 5312 conditions per place. [2022-12-06 06:29:04,967 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 95 selfloop transitions, 9 changer transitions 0/117 dead transitions. [2022-12-06 06:29:04,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 1231 flow [2022-12-06 06:29:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 06:29:04,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-12-06 06:29:04,969 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 549 flow. Second operand 4 states and 73 transitions. [2022-12-06 06:29:04,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 1231 flow [2022-12-06 06:29:04,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 1225 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 06:29:04,984 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 599 flow [2022-12-06 06:29:04,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2022-12-06 06:29:04,985 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-06 06:29:04,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:04,985 INFO L89 Accepts]: Start accepts. Operand has 65 places, 63 transitions, 599 flow [2022-12-06 06:29:04,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:04,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:04,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 63 transitions, 599 flow [2022-12-06 06:29:04,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 63 transitions, 599 flow [2022-12-06 06:29:05,121 INFO L130 PetriNetUnfolder]: 595/1557 cut-off events. [2022-12-06 06:29:05,121 INFO L131 PetriNetUnfolder]: For 2796/3341 co-relation queries the response was YES. [2022-12-06 06:29:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 1557 events. 595/1557 cut-off events. For 2796/3341 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 12891 event pairs, 109 based on Foata normal form. 62/1556 useless extension candidates. Maximal degree in co-relation 5262. Up to 928 conditions per place. [2022-12-06 06:29:05,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 63 transitions, 599 flow [2022-12-06 06:29:05,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 06:29:05,151 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:05,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 06:29:05,152 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 599 flow [2022-12-06 06:29:05,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:29:05,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:05,152 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:29:05,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:29:05,153 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1550054754, now seen corresponding path program 1 times [2022-12-06 06:29:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:05,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569867627] [2022-12-06 06:29:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569867627] [2022-12-06 06:29:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569867627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:05,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:05,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:29:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519531934] [2022-12-06 06:29:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:05,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:05,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:05,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:05,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:05,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:05,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:05,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:06,334 INFO L130 PetriNetUnfolder]: 5055/7953 cut-off events. [2022-12-06 06:29:06,335 INFO L131 PetriNetUnfolder]: For 29270/29880 co-relation queries the response was YES. [2022-12-06 06:29:06,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31355 conditions, 7953 events. 5055/7953 cut-off events. For 29270/29880 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 50590 event pairs, 1019 based on Foata normal form. 638/8460 useless extension candidates. Maximal degree in co-relation 31323. Up to 3056 conditions per place. [2022-12-06 06:29:06,374 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 104 selfloop transitions, 13 changer transitions 8/137 dead transitions. [2022-12-06 06:29:06,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 137 transitions, 1455 flow [2022-12-06 06:29:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 06:29:06,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-06 06:29:06,376 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 599 flow. Second operand 5 states and 91 transitions. [2022-12-06 06:29:06,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 137 transitions, 1455 flow [2022-12-06 06:29:06,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 137 transitions, 1437 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:06,397 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 617 flow [2022-12-06 06:29:06,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=617, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2022-12-06 06:29:06,398 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-06 06:29:06,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:06,398 INFO L89 Accepts]: Start accepts. Operand has 68 places, 65 transitions, 617 flow [2022-12-06 06:29:06,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:06,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:06,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 65 transitions, 617 flow [2022-12-06 06:29:06,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 617 flow [2022-12-06 06:29:06,482 INFO L130 PetriNetUnfolder]: 397/1034 cut-off events. [2022-12-06 06:29:06,482 INFO L131 PetriNetUnfolder]: For 2824/3304 co-relation queries the response was YES. [2022-12-06 06:29:06,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 1034 events. 397/1034 cut-off events. For 2824/3304 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7634 event pairs, 23 based on Foata normal form. 69/1058 useless extension candidates. Maximal degree in co-relation 4038. Up to 519 conditions per place. [2022-12-06 06:29:06,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 65 transitions, 617 flow [2022-12-06 06:29:06,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-06 06:29:06,498 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:06,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 06:29:06,498 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 617 flow [2022-12-06 06:29:06,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:06,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:06,499 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:29:06,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:29:06,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1501893129, now seen corresponding path program 1 times [2022-12-06 06:29:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:06,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695558970] [2022-12-06 06:29:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:06,791 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:29:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:06,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695558970] [2022-12-06 06:29:06,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695558970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:06,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:06,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:29:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302146705] [2022-12-06 06:29:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:06,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:29:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:29:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:29:06,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:06,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:06,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:06,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:06,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:07,636 INFO L130 PetriNetUnfolder]: 4790/7452 cut-off events. [2022-12-06 06:29:07,636 INFO L131 PetriNetUnfolder]: For 28580/29148 co-relation queries the response was YES. [2022-12-06 06:29:07,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30044 conditions, 7452 events. 4790/7452 cut-off events. For 28580/29148 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 47084 event pairs, 982 based on Foata normal form. 297/7620 useless extension candidates. Maximal degree in co-relation 30011. Up to 3025 conditions per place. [2022-12-06 06:29:07,671 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 67 selfloop transitions, 17 changer transitions 45/133 dead transitions. [2022-12-06 06:29:07,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 133 transitions, 1411 flow [2022-12-06 06:29:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:29:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:29:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 06:29:07,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-06 06:29:07,673 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 617 flow. Second operand 6 states and 94 transitions. [2022-12-06 06:29:07,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 133 transitions, 1411 flow [2022-12-06 06:29:07,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 1354 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 06:29:07,873 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 376 flow [2022-12-06 06:29:07,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2022-12-06 06:29:07,873 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-06 06:29:07,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:07,873 INFO L89 Accepts]: Start accepts. Operand has 70 places, 46 transitions, 376 flow [2022-12-06 06:29:07,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:07,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:07,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 46 transitions, 376 flow [2022-12-06 06:29:07,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 46 transitions, 376 flow [2022-12-06 06:29:07,887 INFO L130 PetriNetUnfolder]: 59/160 cut-off events. [2022-12-06 06:29:07,887 INFO L131 PetriNetUnfolder]: For 406/463 co-relation queries the response was YES. [2022-12-06 06:29:07,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 160 events. 59/160 cut-off events. For 406/463 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 628 event pairs, 2 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 611. Up to 53 conditions per place. [2022-12-06 06:29:07,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 46 transitions, 376 flow [2022-12-06 06:29:07,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-06 06:29:08,363 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:29:08,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 491 [2022-12-06 06:29:08,364 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 396 flow [2022-12-06 06:29:08,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:08,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:08,364 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, 1, 1] [2022-12-06 06:29:08,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:29:08,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -191450028, now seen corresponding path program 1 times [2022-12-06 06:29:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325002133] [2022-12-06 06:29:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:09,806 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:29:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:09,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325002133] [2022-12-06 06:29:09,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325002133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:09,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:09,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:29:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859987713] [2022-12-06 06:29:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:09,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:29:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:29:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:29:09,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:09,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 396 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:09,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:09,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:10,248 INFO L130 PetriNetUnfolder]: 1536/2502 cut-off events. [2022-12-06 06:29:10,248 INFO L131 PetriNetUnfolder]: For 13609/13623 co-relation queries the response was YES. [2022-12-06 06:29:10,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11305 conditions, 2502 events. 1536/2502 cut-off events. For 13609/13623 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13468 event pairs, 348 based on Foata normal form. 15/2513 useless extension candidates. Maximal degree in co-relation 11272. Up to 939 conditions per place. [2022-12-06 06:29:10,264 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 88 selfloop transitions, 4 changer transitions 34/130 dead transitions. [2022-12-06 06:29:10,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1322 flow [2022-12-06 06:29:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:29:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:29:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-06 06:29:10,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 06:29:10,265 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 396 flow. Second operand 6 states and 98 transitions. [2022-12-06 06:29:10,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1322 flow [2022-12-06 06:29:10,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 130 transitions, 1023 flow, removed 43 selfloop flow, removed 13 redundant places. [2022-12-06 06:29:10,304 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 308 flow [2022-12-06 06:29:10,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2022-12-06 06:29:10,305 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-06 06:29:10,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:10,305 INFO L89 Accepts]: Start accepts. Operand has 64 places, 46 transitions, 308 flow [2022-12-06 06:29:10,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:10,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:10,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 46 transitions, 308 flow [2022-12-06 06:29:10,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 46 transitions, 308 flow [2022-12-06 06:29:10,329 INFO L130 PetriNetUnfolder]: 102/251 cut-off events. [2022-12-06 06:29:10,329 INFO L131 PetriNetUnfolder]: For 466/505 co-relation queries the response was YES. [2022-12-06 06:29:10,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 251 events. 102/251 cut-off events. For 466/505 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1234 event pairs, 1 based on Foata normal form. 7/229 useless extension candidates. Maximal degree in co-relation 783. Up to 79 conditions per place. [2022-12-06 06:29:10,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 46 transitions, 308 flow [2022-12-06 06:29:10,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 06:29:10,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:10,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 06:29:10,485 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 312 flow [2022-12-06 06:29:10,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:10,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:10,485 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:29:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:29:10,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2017518152, now seen corresponding path program 1 times [2022-12-06 06:29:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:10,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917379158] [2022-12-06 06:29:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:10,679 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:29:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:10,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917379158] [2022-12-06 06:29:10,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917379158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:10,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:10,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:29:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170062357] [2022-12-06 06:29:10,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:10,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:29:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:10,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:29:10,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:29:10,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:29:10,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:29:10,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:10,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:29:10,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:10,959 INFO L130 PetriNetUnfolder]: 1465/2355 cut-off events. [2022-12-06 06:29:10,959 INFO L131 PetriNetUnfolder]: For 6613/6622 co-relation queries the response was YES. [2022-12-06 06:29:10,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9621 conditions, 2355 events. 1465/2355 cut-off events. For 6613/6622 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11652 event pairs, 536 based on Foata normal form. 8/2360 useless extension candidates. Maximal degree in co-relation 9593. Up to 1206 conditions per place. [2022-12-06 06:29:10,974 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 49 selfloop transitions, 2 changer transitions 20/72 dead transitions. [2022-12-06 06:29:10,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 595 flow [2022-12-06 06:29:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:29:10,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 06:29:10,975 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 312 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:29:10,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 595 flow [2022-12-06 06:29:10,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 587 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 06:29:11,000 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 242 flow [2022-12-06 06:29:11,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2022-12-06 06:29:11,001 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2022-12-06 06:29:11,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:11,001 INFO L89 Accepts]: Start accepts. Operand has 63 places, 38 transitions, 242 flow [2022-12-06 06:29:11,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:11,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:11,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 38 transitions, 242 flow [2022-12-06 06:29:11,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 38 transitions, 242 flow [2022-12-06 06:29:11,012 INFO L130 PetriNetUnfolder]: 38/96 cut-off events. [2022-12-06 06:29:11,013 INFO L131 PetriNetUnfolder]: For 227/258 co-relation queries the response was YES. [2022-12-06 06:29:11,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 96 events. 38/96 cut-off events. For 227/258 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 278 event pairs, 0 based on Foata normal form. 4/85 useless extension candidates. Maximal degree in co-relation 294. Up to 31 conditions per place. [2022-12-06 06:29:11,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 38 transitions, 242 flow [2022-12-06 06:29:11,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 06:29:11,526 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:29:11,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526 [2022-12-06 06:29:11,527 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 35 transitions, 212 flow [2022-12-06 06:29:11,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:29:11,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:11,527 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:29:11,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:29:11,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1817962875, now seen corresponding path program 1 times [2022-12-06 06:29:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:11,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174616416] [2022-12-06 06:29:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:29:11,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:29:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:29:11,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:29:11,695 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:29:11,696 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:29:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:29:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:29:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:29:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:29:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:29:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:29:11,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:29:11,703 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:11,707 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:29:11,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:29:11,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:29:11 BasicIcfg [2022-12-06 06:29:11,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:29:11,828 INFO L158 Benchmark]: Toolchain (without parser) took 32294.81ms. Allocated memory was 181.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 146.3MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 06:29:11,828 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:29:11,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.23ms. Allocated memory is still 181.4MB. Free memory was 145.8MB in the beginning and 117.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:29:11,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.68ms. Allocated memory is still 181.4MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:29:11,829 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 181.4MB. Free memory was 114.8MB in the beginning and 113.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:29:11,829 INFO L158 Benchmark]: RCFGBuilder took 732.35ms. Allocated memory is still 181.4MB. Free memory was 113.3MB in the beginning and 75.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:29:11,829 INFO L158 Benchmark]: TraceAbstraction took 30856.77ms. Allocated memory was 181.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 74.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 06:29:11,831 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.13ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 594.23ms. Allocated memory is still 181.4MB. Free memory was 145.8MB in the beginning and 117.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.68ms. Allocated memory is still 181.4MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 181.4MB. Free memory was 114.8MB in the beginning and 113.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 732.35ms. Allocated memory is still 181.4MB. Free memory was 113.3MB in the beginning and 75.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 30856.77ms. Allocated memory was 181.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 74.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 138 PlacesBefore, 48 PlacesAfterwards, 127 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2151, independent: 2075, independent conditional: 2075, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2151, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2151, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2151, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1825, independent: 1778, independent conditional: 0, independent unconditional: 1778, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1825, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 277, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2151, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1825, unknown conditional: 0, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 2636, Positive cache size: 2589, Positive conditional cache size: 0, Positive unconditional cache size: 2589, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 331, independent: 274, independent conditional: 274, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 331, independent: 274, independent conditional: 38, independent unconditional: 236, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 331, independent: 274, independent conditional: 38, independent unconditional: 236, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 331, independent: 274, independent conditional: 38, independent unconditional: 236, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 171, independent: 145, independent conditional: 19, independent unconditional: 126, dependent: 26, dependent conditional: 10, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 171, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 26, dependent conditional: 10, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 104, dependent conditional: 58, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 331, independent: 129, independent conditional: 19, independent unconditional: 110, dependent: 31, dependent conditional: 12, dependent unconditional: 19, unknown: 171, unknown conditional: 29, unknown unconditional: 142] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 145, Positive conditional cache size: 19, Positive unconditional cache size: 126, Negative cache size: 26, Negative conditional cache size: 10, Negative unconditional cache size: 16, 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, 40 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 114, independent conditional: 11, independent unconditional: 103, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 166, Positive conditional cache size: 19, Positive unconditional cache size: 147, Negative cache size: 32, Negative conditional cache size: 10, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 129, independent conditional: 129, 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: 149, independent: 129, independent conditional: 26, independent unconditional: 103, 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: 149, independent: 129, independent conditional: 0, independent unconditional: 129, 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: 149, independent: 129, independent conditional: 0, independent unconditional: 129, 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: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 178, Positive conditional cache size: 19, Positive unconditional cache size: 159, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 113, independent conditional: 113, 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: 134, independent: 113, independent conditional: 21, independent unconditional: 92, 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: 134, independent: 113, independent conditional: 0, independent unconditional: 113, 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: 134, independent: 113, independent conditional: 0, independent unconditional: 113, 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: 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: 134, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 181, Positive conditional cache size: 19, Positive unconditional cache size: 162, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 174, independent: 147, independent conditional: 54, independent unconditional: 93, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 27, dependent conditional: 0, dependent unconditional: 27, 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: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 181, Positive conditional cache size: 19, Positive unconditional cache size: 162, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 148, independent conditional: 50, independent unconditional: 98, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 172, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 183, Positive conditional cache size: 19, Positive unconditional cache size: 164, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 72, independent conditional: 24, independent unconditional: 48, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 94, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 183, Positive conditional cache size: 19, Positive unconditional cache size: 164, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 48, independent conditional: 16, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 70, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 183, Positive conditional cache size: 19, Positive unconditional cache size: 164, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 68, independent conditional: 23, independent unconditional: 45, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 95, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 187, Positive conditional cache size: 19, Positive unconditional cache size: 168, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 104, independent conditional: 25, independent unconditional: 79, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 192, Positive conditional cache size: 19, Positive unconditional cache size: 173, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 70 PlacesBefore, 68 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 142, independent conditional: 61, independent unconditional: 81, dependent: 49, dependent conditional: 23, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, independent: 142, independent conditional: 25, independent unconditional: 117, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, independent: 142, independent conditional: 25, independent unconditional: 117, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 237, independent: 131, independent conditional: 21, independent unconditional: 110, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 16, unknown conditional: 4, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 232, Positive conditional cache size: 26, Positive unconditional cache size: 206, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 63 PlacesBefore, 63 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 22, dependent conditional: 12, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 78, independent conditional: 68, independent unconditional: 10, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 78, independent conditional: 68, independent unconditional: 10, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 67, independent conditional: 59, independent unconditional: 8, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 13, unknown conditional: 9, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 251, Positive conditional cache size: 35, Positive unconditional cache size: 216, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 62 PlacesBefore, 59 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 93, 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: 113, independent: 93, independent conditional: 91, independent unconditional: 2, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 93, independent conditional: 61, independent unconditional: 32, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 93, independent conditional: 61, independent unconditional: 32, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 75, independent conditional: 52, independent unconditional: 23, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 298, Positive conditional cache size: 47, Positive unconditional cache size: 251, Negative cache size: 51, Negative conditional cache size: 10, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 3 - 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1249, ((void *)0), P0, ((void *)0))=-2, t1249={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1250; [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1250, ((void *)0), P1, ((void *)0))=-1, t1249={5:0}, t1250={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t1251; [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1251, ((void *)0), P2, ((void *)0))=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] 0 pthread_t t1252; [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1252, ((void *)0), P3, ((void *)0))=1, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __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}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __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}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 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: 30.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1066 IncrementalHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 20 mSDtfsCounter, 1066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=617occurred in iteration=10, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:29:11,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...