/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/mix039.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:26:31,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:26:31,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:26:31,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:26:31,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:26:31,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:26:31,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:26:31,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:26:31,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:26:31,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:26:31,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:26:31,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:26:31,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:26:31,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:26:31,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:26:31,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:26:31,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:26:31,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:26:31,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:26:31,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:26:31,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:26:31,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:26:31,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:26:31,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:26:31,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:26:31,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:26:31,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:26:31,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:26:31,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:26:31,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:26:31,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:26:31,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:26:31,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:26:31,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:26:31,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:26:31,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:26:31,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:26:31,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:26:31,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:26:31,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:26:31,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:26:31,298 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:26:31,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:26:31,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:26:31,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:26:31,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:26:31,335 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:26:31,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:26:31,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:26:31,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:26:31,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:26:31,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:26:31,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:26:31,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:26:31,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:26:31,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:26:31,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:26:31,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:26:31,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:26:31,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:26:31,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:26:31,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:26:31,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:26:31,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:26:31,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:26:31,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:26:31,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:26:31,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:26:31,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:26:31,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:26:31,339 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:26:31,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:26:31,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:26:31,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:26:31,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:26:31,702 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:26:31,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2022-12-06 06:26:32,936 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:26:33,259 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:26:33,260 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2022-12-06 06:26:33,284 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d49e7b2a/33f31a328f40494889da36033edf974a/FLAG40e0915e1 [2022-12-06 06:26:33,306 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d49e7b2a/33f31a328f40494889da36033edf974a [2022-12-06 06:26:33,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:26:33,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:26:33,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:26:33,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:26:33,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:26:33,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa4e311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33, skipping insertion in model container [2022-12-06 06:26:33,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:26:33,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:26:33,501 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/mix039.opt.i[944,957] [2022-12-06 06:26:33,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:26:33,725 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:26:33,736 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/mix039.opt.i[944,957] [2022-12-06 06:26:33,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:26:33,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:26:33,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:26:33,835 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:26:33,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33 WrapperNode [2022-12-06 06:26:33,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:26:33,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:26:33,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:26:33,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:26:33,844 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:26:33" (1/1) ... [2022-12-06 06:26:33,877 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:26:33" (1/1) ... [2022-12-06 06:26:33,899 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-06 06:26:33,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:26:33,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:26:33,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:26:33,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:26:33,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:26:33,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:26:33,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:26:33,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:26:33,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (1/1) ... [2022-12-06 06:26:33,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:26:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:26:33,983 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:26:34,010 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:26:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:26:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:26:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:26:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:26:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:26:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:26:34,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:26:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:26:34,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:26:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:26:34,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:26:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:26:34,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:26:34,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:26:34,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:26:34,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:26:34,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:26:34,031 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:26:34,212 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:26:34,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:26:34,566 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:26:34,751 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:26:34,752 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:26:34,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:26:34 BoogieIcfgContainer [2022-12-06 06:26:34,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:26:34,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:26:34,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:26:34,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:26:34,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:26:33" (1/3) ... [2022-12-06 06:26:34,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3c158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:26:34, skipping insertion in model container [2022-12-06 06:26:34,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:26:33" (2/3) ... [2022-12-06 06:26:34,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3c158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:26:34, skipping insertion in model container [2022-12-06 06:26:34,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:26:34" (3/3) ... [2022-12-06 06:26:34,775 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2022-12-06 06:26:34,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:26:34,794 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:26:34,794 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:26:34,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:26:34,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:26:35,014 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:26:35,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:35,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 06:26:35,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:26:35,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 06:26:35,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:35,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:26:35,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 06:26:35,125 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:26:35,125 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:35,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 06:26:35,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:26:35,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-06 06:26:40,195 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-06 06:26:40,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:26:40,214 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;@4b27515d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:26:40,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:26:40,220 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:26:40,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:40,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:40,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:40,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash -951910600, now seen corresponding path program 1 times [2022-12-06 06:26:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:40,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115203757] [2022-12-06 06:26:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:40,657 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:26:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:40,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115203757] [2022-12-06 06:26:40,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115203757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:40,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:40,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:26:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034572362] [2022-12-06 06:26:40,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:40,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:26:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:40,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:26:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:26:40,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:26:40,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 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:26:40,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:40,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:26:40,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:41,223 INFO L130 PetriNetUnfolder]: 2483/3884 cut-off events. [2022-12-06 06:26:41,224 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 06:26:41,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7432 conditions, 3884 events. 2483/3884 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22602 event pairs, 593 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7420. Up to 2539 conditions per place. [2022-12-06 06:26:41,250 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 29 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 06:26:41,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-12-06 06:26:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:26:41,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-06 06:26:41,261 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:26:41,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-12-06 06:26:41,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:26:41,267 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 06:26:41,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 06:26:41,274 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 06:26:41,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:41,275 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 06:26:41,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:41,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:41,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 06:26:41,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 06:26:41,285 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:26:41,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:41,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:26:41,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 06:26:41,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:26:41,391 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:41,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 06:26:41,394 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-06 06:26:41,394 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:26:41,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:41,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:41,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:26:41,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash 41946315, now seen corresponding path program 1 times [2022-12-06 06:26:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:41,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208774480] [2022-12-06 06:26:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:41,634 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:26:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:41,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208774480] [2022-12-06 06:26:41,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208774480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:41,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:41,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:26:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967174829] [2022-12-06 06:26:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:26:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:26:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:26:41,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:26:41,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 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:26:41,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:41,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:26:41,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:42,511 INFO L130 PetriNetUnfolder]: 6447/8936 cut-off events. [2022-12-06 06:26:42,512 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-06 06:26:42,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18470 conditions, 8936 events. 6447/8936 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 43235 event pairs, 2195 based on Foata normal form. 200/9136 useless extension candidates. Maximal degree in co-relation 18460. Up to 6533 conditions per place. [2022-12-06 06:26:42,573 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2022-12-06 06:26:42,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 208 flow [2022-12-06 06:26:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 06:26:42,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 06:26:42,576 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 48 transitions. [2022-12-06 06:26:42,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 208 flow [2022-12-06 06:26:42,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:26:42,582 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 112 flow [2022-12-06 06:26:42,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-06 06:26:42,583 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 06:26:42,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:42,583 INFO L89 Accepts]: Start accepts. Operand has 38 places, 31 transitions, 112 flow [2022-12-06 06:26:42,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:42,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:42,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 112 flow [2022-12-06 06:26:42,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 112 flow [2022-12-06 06:26:42,613 INFO L130 PetriNetUnfolder]: 152/361 cut-off events. [2022-12-06 06:26:42,614 INFO L131 PetriNetUnfolder]: For 40/48 co-relation queries the response was YES. [2022-12-06 06:26:42,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 361 events. 152/361 cut-off events. For 40/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1991 event pairs, 72 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 720. Up to 221 conditions per place. [2022-12-06 06:26:42,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 112 flow [2022-12-06 06:26:42,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-06 06:26:42,644 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:42,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 06:26:42,645 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 112 flow [2022-12-06 06:26:42,646 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:26:42,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:42,646 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:42,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:26:42,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1300334012, now seen corresponding path program 1 times [2022-12-06 06:26:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:42,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443592326] [2022-12-06 06:26:42,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:42,783 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:26:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443592326] [2022-12-06 06:26:42,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443592326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:42,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:42,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:26:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833205568] [2022-12-06 06:26:42,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:42,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:42,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:42,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:42,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:26:42,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 112 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:26:42,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:42,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:26:42,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:43,651 INFO L130 PetriNetUnfolder]: 5983/8304 cut-off events. [2022-12-06 06:26:43,652 INFO L131 PetriNetUnfolder]: For 3308/3308 co-relation queries the response was YES. [2022-12-06 06:26:43,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21088 conditions, 8304 events. 5983/8304 cut-off events. For 3308/3308 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 38707 event pairs, 1691 based on Foata normal form. 112/8416 useless extension candidates. Maximal degree in co-relation 21076. Up to 4373 conditions per place. [2022-12-06 06:26:43,715 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 06:26:43,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 284 flow [2022-12-06 06:26:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 06:26:43,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49 [2022-12-06 06:26:43,719 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 112 flow. Second operand 4 states and 49 transitions. [2022-12-06 06:26:43,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 284 flow [2022-12-06 06:26:43,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:26:43,741 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 156 flow [2022-12-06 06:26:43,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-06 06:26:43,742 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 06:26:43,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:43,743 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 156 flow [2022-12-06 06:26:43,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:43,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:43,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 156 flow [2022-12-06 06:26:43,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 156 flow [2022-12-06 06:26:43,769 INFO L130 PetriNetUnfolder]: 122/289 cut-off events. [2022-12-06 06:26:43,770 INFO L131 PetriNetUnfolder]: For 145/174 co-relation queries the response was YES. [2022-12-06 06:26:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 289 events. 122/289 cut-off events. For 145/174 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1448 event pairs, 41 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 703. Up to 181 conditions per place. [2022-12-06 06:26:43,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 156 flow [2022-12-06 06:26:43,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-06 06:26:43,789 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:43,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 06:26:43,790 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 156 flow [2022-12-06 06:26:43,790 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:26:43,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:43,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:43,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:26:43,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1670517345, now seen corresponding path program 1 times [2022-12-06 06:26:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729277915] [2022-12-06 06:26:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:44,010 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:26:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729277915] [2022-12-06 06:26:44,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729277915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:44,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:26:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470917146] [2022-12-06 06:26:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:44,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:26:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:44,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:26:44,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:26:44,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:26:44,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 156 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:26:44,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:44,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:26:44,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:44,664 INFO L130 PetriNetUnfolder]: 4581/6656 cut-off events. [2022-12-06 06:26:44,664 INFO L131 PetriNetUnfolder]: For 3947/4009 co-relation queries the response was YES. [2022-12-06 06:26:44,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17121 conditions, 6656 events. 4581/6656 cut-off events. For 3947/4009 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 35511 event pairs, 1270 based on Foata normal form. 31/6447 useless extension candidates. Maximal degree in co-relation 17106. Up to 5827 conditions per place. [2022-12-06 06:26:44,708 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 38 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2022-12-06 06:26:44,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 296 flow [2022-12-06 06:26:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:26:44,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-06 06:26:44,710 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 156 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:26:44,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 296 flow [2022-12-06 06:26:44,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:44,718 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 205 flow [2022-12-06 06:26:44,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-06 06:26:44,718 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 06:26:44,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:44,719 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 205 flow [2022-12-06 06:26:44,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:44,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:44,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 205 flow [2022-12-06 06:26:44,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 205 flow [2022-12-06 06:26:44,742 INFO L130 PetriNetUnfolder]: 106/259 cut-off events. [2022-12-06 06:26:44,742 INFO L131 PetriNetUnfolder]: For 181/217 co-relation queries the response was YES. [2022-12-06 06:26:44,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 259 events. 106/259 cut-off events. For 181/217 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1253 event pairs, 32 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 696. Up to 161 conditions per place. [2022-12-06 06:26:44,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 205 flow [2022-12-06 06:26:44,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 06:26:44,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:44,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 06:26:44,749 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 205 flow [2022-12-06 06:26:44,749 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:26:44,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:44,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:44,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:26:44,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 246460940, now seen corresponding path program 1 times [2022-12-06 06:26:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:44,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360497914] [2022-12-06 06:26:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:44,880 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:26:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360497914] [2022-12-06 06:26:44,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360497914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:44,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767929980] [2022-12-06 06:26:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:44,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:44,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:44,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:44,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 06:26:44,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:44,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:44,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 06:26:44,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:45,572 INFO L130 PetriNetUnfolder]: 3891/5801 cut-off events. [2022-12-06 06:26:45,573 INFO L131 PetriNetUnfolder]: For 4519/4903 co-relation queries the response was YES. [2022-12-06 06:26:45,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15190 conditions, 5801 events. 3891/5801 cut-off events. For 4519/4903 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 33391 event pairs, 753 based on Foata normal form. 538/6031 useless extension candidates. Maximal degree in co-relation 15173. Up to 3836 conditions per place. [2022-12-06 06:26:45,604 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 70 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2022-12-06 06:26:45,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 583 flow [2022-12-06 06:26:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:26:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:26:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 06:26:45,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 06:26:45,608 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 205 flow. Second operand 5 states and 80 transitions. [2022-12-06 06:26:45,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 583 flow [2022-12-06 06:26:45,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:45,613 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 274 flow [2022-12-06 06:26:45,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2022-12-06 06:26:45,616 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 06:26:45,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:45,616 INFO L89 Accepts]: Start accepts. Operand has 50 places, 48 transitions, 274 flow [2022-12-06 06:26:45,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:45,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:45,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 48 transitions, 274 flow [2022-12-06 06:26:45,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 274 flow [2022-12-06 06:26:45,714 INFO L130 PetriNetUnfolder]: 660/1282 cut-off events. [2022-12-06 06:26:45,714 INFO L131 PetriNetUnfolder]: For 1085/1601 co-relation queries the response was YES. [2022-12-06 06:26:45,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 1282 events. 660/1282 cut-off events. For 1085/1601 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 8966 event pairs, 300 based on Foata normal form. 11/1137 useless extension candidates. Maximal degree in co-relation 3767. Up to 804 conditions per place. [2022-12-06 06:26:45,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 48 transitions, 274 flow [2022-12-06 06:26:45,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-06 06:26:45,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [483] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_139 (+ v_~__unbuffered_cnt~0_140 1)) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 06:26:45,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [495] L758-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_159 (+ v_~__unbuffered_cnt~0_160 1)) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_160} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:26:45,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [423] L801-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 06:26:45,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [452] L839-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_13|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-06 06:26:45,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:26:45,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-06 06:26:45,897 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 284 flow [2022-12-06 06:26:45,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:45,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:45,898 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:26:45,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:26:45,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1948717078, now seen corresponding path program 1 times [2022-12-06 06:26:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:45,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014435785] [2022-12-06 06:26:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:46,074 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:26:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:46,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014435785] [2022-12-06 06:26:46,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014435785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:46,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:46,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:26:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034052144] [2022-12-06 06:26:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:46,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:46,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:46,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:26:46,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:46,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:46,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:26:46,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:46,665 INFO L130 PetriNetUnfolder]: 2786/4391 cut-off events. [2022-12-06 06:26:46,666 INFO L131 PetriNetUnfolder]: For 6032/6756 co-relation queries the response was YES. [2022-12-06 06:26:46,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15100 conditions, 4391 events. 2786/4391 cut-off events. For 6032/6756 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 26119 event pairs, 295 based on Foata normal form. 474/4668 useless extension candidates. Maximal degree in co-relation 15079. Up to 1835 conditions per place. [2022-12-06 06:26:46,700 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 81 selfloop transitions, 18 changer transitions 3/114 dead transitions. [2022-12-06 06:26:46,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 114 transitions, 810 flow [2022-12-06 06:26:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:26:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:26:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-06 06:26:46,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-06 06:26:46,701 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 284 flow. Second operand 6 states and 102 transitions. [2022-12-06 06:26:46,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 114 transitions, 810 flow [2022-12-06 06:26:46,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 114 transitions, 797 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:46,711 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 403 flow [2022-12-06 06:26:46,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-06 06:26:46,712 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 06:26:46,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:46,712 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 403 flow [2022-12-06 06:26:46,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:46,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:46,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 403 flow [2022-12-06 06:26:46,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 403 flow [2022-12-06 06:26:46,803 INFO L130 PetriNetUnfolder]: 483/1063 cut-off events. [2022-12-06 06:26:46,803 INFO L131 PetriNetUnfolder]: For 3142/5281 co-relation queries the response was YES. [2022-12-06 06:26:46,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4648 conditions, 1063 events. 483/1063 cut-off events. For 3142/5281 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 7681 event pairs, 90 based on Foata normal form. 23/990 useless extension candidates. Maximal degree in co-relation 4626. Up to 778 conditions per place. [2022-12-06 06:26:46,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 403 flow [2022-12-06 06:26:46,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-06 06:26:47,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:26:47,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 474 [2022-12-06 06:26:47,187 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 395 flow [2022-12-06 06:26:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:47,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:47,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:26:47,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -834792891, now seen corresponding path program 1 times [2022-12-06 06:26:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:47,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120892378] [2022-12-06 06:26:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:47,400 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:26:47,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:47,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120892378] [2022-12-06 06:26:47,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120892378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:47,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:47,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:26:47,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601550941] [2022-12-06 06:26:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:47,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:26:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:26:47,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:26:47,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:26:47,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:47,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:47,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:26:47,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:47,847 INFO L130 PetriNetUnfolder]: 1884/3037 cut-off events. [2022-12-06 06:26:47,848 INFO L131 PetriNetUnfolder]: For 8199/9054 co-relation queries the response was YES. [2022-12-06 06:26:47,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12209 conditions, 3037 events. 1884/3037 cut-off events. For 8199/9054 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17297 event pairs, 209 based on Foata normal form. 352/3297 useless extension candidates. Maximal degree in co-relation 12184. Up to 1267 conditions per place. [2022-12-06 06:26:47,872 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 89 selfloop transitions, 26 changer transitions 13/140 dead transitions. [2022-12-06 06:26:47,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 1097 flow [2022-12-06 06:26:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:26:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:26:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-06 06:26:47,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-06 06:26:47,874 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 395 flow. Second operand 8 states and 132 transitions. [2022-12-06 06:26:47,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 1097 flow [2022-12-06 06:26:47,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 140 transitions, 1045 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 06:26:47,931 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 517 flow [2022-12-06 06:26:47,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=517, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2022-12-06 06:26:47,932 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2022-12-06 06:26:47,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:47,932 INFO L89 Accepts]: Start accepts. Operand has 63 places, 64 transitions, 517 flow [2022-12-06 06:26:47,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:47,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:47,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 64 transitions, 517 flow [2022-12-06 06:26:47,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 64 transitions, 517 flow [2022-12-06 06:26:48,009 INFO L130 PetriNetUnfolder]: 283/680 cut-off events. [2022-12-06 06:26:48,009 INFO L131 PetriNetUnfolder]: For 2748/3086 co-relation queries the response was YES. [2022-12-06 06:26:48,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 680 events. 283/680 cut-off events. For 2748/3086 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4517 event pairs, 20 based on Foata normal form. 1/640 useless extension candidates. Maximal degree in co-relation 3144. Up to 337 conditions per place. [2022-12-06 06:26:48,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 64 transitions, 517 flow [2022-12-06 06:26:48,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-06 06:26:48,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:26:48,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 06:26:48,083 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 507 flow [2022-12-06 06:26:48,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:48,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:48,084 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:26:48,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:26:48,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -941642747, now seen corresponding path program 1 times [2022-12-06 06:26:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:48,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060987346] [2022-12-06 06:26:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:48,278 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:26:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060987346] [2022-12-06 06:26:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060987346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:48,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:48,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738914250] [2022-12-06 06:26:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:48,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:26:48,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 507 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:48,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:48,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:26:48,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:48,797 INFO L130 PetriNetUnfolder]: 2990/4528 cut-off events. [2022-12-06 06:26:48,798 INFO L131 PetriNetUnfolder]: For 15523/15523 co-relation queries the response was YES. [2022-12-06 06:26:48,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19126 conditions, 4528 events. 2990/4528 cut-off events. For 15523/15523 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 23353 event pairs, 303 based on Foata normal form. 11/4539 useless extension candidates. Maximal degree in co-relation 19099. Up to 2311 conditions per place. [2022-12-06 06:26:48,822 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 106 selfloop transitions, 30 changer transitions 44/180 dead transitions. [2022-12-06 06:26:48,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 180 transitions, 1819 flow [2022-12-06 06:26:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:26:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:26:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 06:26:48,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6689655172413793 [2022-12-06 06:26:48,824 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 507 flow. Second operand 5 states and 97 transitions. [2022-12-06 06:26:48,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 180 transitions, 1819 flow [2022-12-06 06:26:48,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 180 transitions, 1428 flow, removed 132 selfloop flow, removed 6 redundant places. [2022-12-06 06:26:48,905 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 565 flow [2022-12-06 06:26:48,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=565, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2022-12-06 06:26:48,906 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2022-12-06 06:26:48,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:48,907 INFO L89 Accepts]: Start accepts. Operand has 64 places, 69 transitions, 565 flow [2022-12-06 06:26:48,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:48,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:48,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 69 transitions, 565 flow [2022-12-06 06:26:48,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 69 transitions, 565 flow [2022-12-06 06:26:48,968 INFO L130 PetriNetUnfolder]: 252/585 cut-off events. [2022-12-06 06:26:48,968 INFO L131 PetriNetUnfolder]: For 1065/1128 co-relation queries the response was YES. [2022-12-06 06:26:48,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 585 events. 252/585 cut-off events. For 1065/1128 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3353 event pairs, 16 based on Foata normal form. 2/558 useless extension candidates. Maximal degree in co-relation 2116. Up to 194 conditions per place. [2022-12-06 06:26:48,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 69 transitions, 565 flow [2022-12-06 06:26:48,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-06 06:26:48,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:48,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 06:26:48,981 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 69 transitions, 565 flow [2022-12-06 06:26:48,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:48,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:48,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:48,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:26:48,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:48,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:48,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1307116140, now seen corresponding path program 1 times [2022-12-06 06:26:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:48,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896893682] [2022-12-06 06:26:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:49,779 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:26:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896893682] [2022-12-06 06:26:49,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896893682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:49,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:49,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:26:49,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857199888] [2022-12-06 06:26:49,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:49,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:26:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:49,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:26:49,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:26:49,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:26:49,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 69 transitions, 565 flow. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:49,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:49,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:26:49,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:50,689 INFO L130 PetriNetUnfolder]: 3590/5567 cut-off events. [2022-12-06 06:26:50,689 INFO L131 PetriNetUnfolder]: For 16687/16687 co-relation queries the response was YES. [2022-12-06 06:26:50,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24252 conditions, 5567 events. 3590/5567 cut-off events. For 16687/16687 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 30290 event pairs, 353 based on Foata normal form. 10/5577 useless extension candidates. Maximal degree in co-relation 24224. Up to 2005 conditions per place. [2022-12-06 06:26:50,721 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 128 selfloop transitions, 73 changer transitions 128/329 dead transitions. [2022-12-06 06:26:50,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 329 transitions, 3168 flow [2022-12-06 06:26:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:26:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:26:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 161 transitions. [2022-12-06 06:26:50,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49538461538461537 [2022-12-06 06:26:50,723 INFO L175 Difference]: Start difference. First operand has 59 places, 69 transitions, 565 flow. Second operand 13 states and 161 transitions. [2022-12-06 06:26:50,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 329 transitions, 3168 flow [2022-12-06 06:26:50,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 329 transitions, 3154 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:50,828 INFO L231 Difference]: Finished difference. Result has 79 places, 117 transitions, 1258 flow [2022-12-06 06:26:50,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1258, PETRI_PLACES=79, PETRI_TRANSITIONS=117} [2022-12-06 06:26:50,829 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2022-12-06 06:26:50,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:50,829 INFO L89 Accepts]: Start accepts. Operand has 79 places, 117 transitions, 1258 flow [2022-12-06 06:26:50,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:50,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:50,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 117 transitions, 1258 flow [2022-12-06 06:26:50,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 117 transitions, 1258 flow [2022-12-06 06:26:50,948 INFO L130 PetriNetUnfolder]: 571/1209 cut-off events. [2022-12-06 06:26:50,948 INFO L131 PetriNetUnfolder]: For 4098/4172 co-relation queries the response was YES. [2022-12-06 06:26:50,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5226 conditions, 1209 events. 571/1209 cut-off events. For 4098/4172 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8015 event pairs, 31 based on Foata normal form. 3/1156 useless extension candidates. Maximal degree in co-relation 5191. Up to 350 conditions per place. [2022-12-06 06:26:50,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 117 transitions, 1258 flow [2022-12-06 06:26:50,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 06:26:51,417 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:26:51,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 590 [2022-12-06 06:26:51,419 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 117 transitions, 1280 flow [2022-12-06 06:26:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:51,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:51,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:51,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:26:51,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1205475246, now seen corresponding path program 2 times [2022-12-06 06:26:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:51,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346987134] [2022-12-06 06:26:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:51,633 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:26:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:51,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346987134] [2022-12-06 06:26:51,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346987134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:51,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:51,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:26:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940843275] [2022-12-06 06:26:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:51,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:26:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:26:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:26:51,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:26:51,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 117 transitions, 1280 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:51,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:51,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:26:51,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:52,106 INFO L130 PetriNetUnfolder]: 1806/2912 cut-off events. [2022-12-06 06:26:52,106 INFO L131 PetriNetUnfolder]: For 13697/13952 co-relation queries the response was YES. [2022-12-06 06:26:52,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13954 conditions, 2912 events. 1806/2912 cut-off events. For 13697/13952 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16499 event pairs, 114 based on Foata normal form. 186/3014 useless extension candidates. Maximal degree in co-relation 13921. Up to 1055 conditions per place. [2022-12-06 06:26:52,126 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 146 selfloop transitions, 18 changer transitions 27/229 dead transitions. [2022-12-06 06:26:52,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 229 transitions, 2639 flow [2022-12-06 06:26:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:26:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:26:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-06 06:26:52,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2022-12-06 06:26:52,127 INFO L175 Difference]: Start difference. First operand has 75 places, 117 transitions, 1280 flow. Second operand 8 states and 109 transitions. [2022-12-06 06:26:52,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 229 transitions, 2639 flow [2022-12-06 06:26:52,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 229 transitions, 2541 flow, removed 46 selfloop flow, removed 5 redundant places. [2022-12-06 06:26:52,180 INFO L231 Difference]: Finished difference. Result has 80 places, 116 transitions, 1250 flow [2022-12-06 06:26:52,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1250, PETRI_PLACES=80, PETRI_TRANSITIONS=116} [2022-12-06 06:26:52,181 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 06:26:52,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:52,181 INFO L89 Accepts]: Start accepts. Operand has 80 places, 116 transitions, 1250 flow [2022-12-06 06:26:52,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:52,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:52,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 116 transitions, 1250 flow [2022-12-06 06:26:52,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 116 transitions, 1250 flow [2022-12-06 06:26:52,270 INFO L130 PetriNetUnfolder]: 516/1098 cut-off events. [2022-12-06 06:26:52,271 INFO L131 PetriNetUnfolder]: For 3926/4073 co-relation queries the response was YES. [2022-12-06 06:26:52,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 1098 events. 516/1098 cut-off events. For 3926/4073 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7247 event pairs, 12 based on Foata normal form. 8/1058 useless extension candidates. Maximal degree in co-relation 5037. Up to 330 conditions per place. [2022-12-06 06:26:52,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 116 transitions, 1250 flow [2022-12-06 06:26:52,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-06 06:26:52,599 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:26:52,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-06 06:26:52,600 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 113 transitions, 1234 flow [2022-12-06 06:26:52,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:52,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:52,600 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:26:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:26:52,600 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -669968727, now seen corresponding path program 1 times [2022-12-06 06:26:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:52,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939343262] [2022-12-06 06:26:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:52,807 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:26:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:52,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939343262] [2022-12-06 06:26:52,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939343262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:52,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:52,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797749838] [2022-12-06 06:26:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:52,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:52,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:52,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:52,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 06:26:52,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 113 transitions, 1234 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:52,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:52,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 06:26:52,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:53,260 INFO L130 PetriNetUnfolder]: 2196/3550 cut-off events. [2022-12-06 06:26:53,260 INFO L131 PetriNetUnfolder]: For 17079/17188 co-relation queries the response was YES. [2022-12-06 06:26:53,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18029 conditions, 3550 events. 2196/3550 cut-off events. For 17079/17188 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20284 event pairs, 265 based on Foata normal form. 24/3522 useless extension candidates. Maximal degree in co-relation 17991. Up to 1502 conditions per place. [2022-12-06 06:26:53,282 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 79 selfloop transitions, 2 changer transitions 74/172 dead transitions. [2022-12-06 06:26:53,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 172 transitions, 1958 flow [2022-12-06 06:26:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 06:26:53,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2022-12-06 06:26:53,284 INFO L175 Difference]: Start difference. First operand has 76 places, 113 transitions, 1234 flow. Second operand 4 states and 56 transitions. [2022-12-06 06:26:53,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 172 transitions, 1958 flow [2022-12-06 06:26:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 172 transitions, 1827 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-12-06 06:26:53,337 INFO L231 Difference]: Finished difference. Result has 72 places, 82 transitions, 775 flow [2022-12-06 06:26:53,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=775, PETRI_PLACES=72, PETRI_TRANSITIONS=82} [2022-12-06 06:26:53,338 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2022-12-06 06:26:53,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:53,338 INFO L89 Accepts]: Start accepts. Operand has 72 places, 82 transitions, 775 flow [2022-12-06 06:26:53,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:53,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:53,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 82 transitions, 775 flow [2022-12-06 06:26:53,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 82 transitions, 775 flow [2022-12-06 06:26:53,398 INFO L130 PetriNetUnfolder]: 293/663 cut-off events. [2022-12-06 06:26:53,398 INFO L131 PetriNetUnfolder]: For 3128/3241 co-relation queries the response was YES. [2022-12-06 06:26:53,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 663 events. 293/663 cut-off events. For 3128/3241 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4233 event pairs, 15 based on Foata normal form. 50/678 useless extension candidates. Maximal degree in co-relation 2598. Up to 180 conditions per place. [2022-12-06 06:26:53,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 82 transitions, 775 flow [2022-12-06 06:26:53,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-06 06:26:53,408 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:53,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 06:26:53,410 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 82 transitions, 775 flow [2022-12-06 06:26:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:53,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:53,410 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:26:53,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:26:53,410 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -457981211, now seen corresponding path program 2 times [2022-12-06 06:26:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:53,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144188485] [2022-12-06 06:26:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:53,608 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:26:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:53,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144188485] [2022-12-06 06:26:53,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144188485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:53,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:53,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485461320] [2022-12-06 06:26:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:53,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:53,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:53,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:53,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:26:53,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 82 transitions, 775 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:53,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:53,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:26:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:53,927 INFO L130 PetriNetUnfolder]: 1655/2661 cut-off events. [2022-12-06 06:26:53,927 INFO L131 PetriNetUnfolder]: For 11419/11419 co-relation queries the response was YES. [2022-12-06 06:26:53,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12438 conditions, 2661 events. 1655/2661 cut-off events. For 11419/11419 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13666 event pairs, 475 based on Foata normal form. 1/2662 useless extension candidates. Maximal degree in co-relation 12405. Up to 1340 conditions per place. [2022-12-06 06:26:53,936 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 67 selfloop transitions, 16 changer transitions 34/117 dead transitions. [2022-12-06 06:26:53,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 117 transitions, 1212 flow [2022-12-06 06:26:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:26:53,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-06 06:26:53,937 INFO L175 Difference]: Start difference. First operand has 71 places, 82 transitions, 775 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:26:53,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 117 transitions, 1212 flow [2022-12-06 06:26:53,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 117 transitions, 1139 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 06:26:53,967 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 535 flow [2022-12-06 06:26:53,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2022-12-06 06:26:53,967 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2022-12-06 06:26:53,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:53,967 INFO L89 Accepts]: Start accepts. Operand has 72 places, 61 transitions, 535 flow [2022-12-06 06:26:53,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:53,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:53,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 61 transitions, 535 flow [2022-12-06 06:26:53,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 535 flow [2022-12-06 06:26:53,989 INFO L130 PetriNetUnfolder]: 132/317 cut-off events. [2022-12-06 06:26:53,989 INFO L131 PetriNetUnfolder]: For 1191/1250 co-relation queries the response was YES. [2022-12-06 06:26:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 317 events. 132/317 cut-off events. For 1191/1250 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1689 event pairs, 8 based on Foata normal form. 24/326 useless extension candidates. Maximal degree in co-relation 1192. Up to 92 conditions per place. [2022-12-06 06:26:53,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 61 transitions, 535 flow [2022-12-06 06:26:53,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 06:26:54,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:26:54,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 06:26:54,155 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 545 flow [2022-12-06 06:26:54,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:54,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:54,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:54,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:26:54,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1647676909, now seen corresponding path program 1 times [2022-12-06 06:26:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:54,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704155052] [2022-12-06 06:26:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:54,328 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:26:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:54,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704155052] [2022-12-06 06:26:54,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704155052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:54,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:54,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171886675] [2022-12-06 06:26:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:54,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:54,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:26:54,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 545 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:54,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:54,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:26:54,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:54,509 INFO L130 PetriNetUnfolder]: 684/1140 cut-off events. [2022-12-06 06:26:54,509 INFO L131 PetriNetUnfolder]: For 4207/4207 co-relation queries the response was YES. [2022-12-06 06:26:54,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5235 conditions, 1140 events. 684/1140 cut-off events. For 4207/4207 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4999 event pairs, 128 based on Foata normal form. 1/1135 useless extension candidates. Maximal degree in co-relation 5201. Up to 657 conditions per place. [2022-12-06 06:26:54,515 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 63 selfloop transitions, 25 changer transitions 12/100 dead transitions. [2022-12-06 06:26:54,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 976 flow [2022-12-06 06:26:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:26:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:26:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:26:54,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 06:26:54,516 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 545 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:26:54,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 976 flow [2022-12-06 06:26:54,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 918 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 06:26:54,525 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 640 flow [2022-12-06 06:26:54,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=640, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2022-12-06 06:26:54,526 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-06 06:26:54,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:54,526 INFO L89 Accepts]: Start accepts. Operand has 73 places, 65 transitions, 640 flow [2022-12-06 06:26:54,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:54,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:54,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 65 transitions, 640 flow [2022-12-06 06:26:54,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 65 transitions, 640 flow [2022-12-06 06:26:54,550 INFO L130 PetriNetUnfolder]: 138/357 cut-off events. [2022-12-06 06:26:54,550 INFO L131 PetriNetUnfolder]: For 1485/1535 co-relation queries the response was YES. [2022-12-06 06:26:54,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 357 events. 138/357 cut-off events. For 1485/1535 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2040 event pairs, 5 based on Foata normal form. 21/364 useless extension candidates. Maximal degree in co-relation 1413. Up to 102 conditions per place. [2022-12-06 06:26:54,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 65 transitions, 640 flow [2022-12-06 06:26:54,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:26:54,555 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:54,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 06:26:54,555 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 640 flow [2022-12-06 06:26:54,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:54,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:54,556 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:26:54,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:26:54,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash -526347949, now seen corresponding path program 3 times [2022-12-06 06:26:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:54,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115018770] [2022-12-06 06:26:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:54,723 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:26:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115018770] [2022-12-06 06:26:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115018770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:54,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:54,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:26:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317083992] [2022-12-06 06:26:54,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:54,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:54,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:54,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:26:54,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 640 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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:26:54,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:54,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:26:54,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:54,941 INFO L130 PetriNetUnfolder]: 662/1134 cut-off events. [2022-12-06 06:26:54,942 INFO L131 PetriNetUnfolder]: For 5213/5213 co-relation queries the response was YES. [2022-12-06 06:26:54,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5583 conditions, 1134 events. 662/1134 cut-off events. For 5213/5213 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5150 event pairs, 136 based on Foata normal form. 1/1135 useless extension candidates. Maximal degree in co-relation 5549. Up to 523 conditions per place. [2022-12-06 06:26:54,948 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 45 selfloop transitions, 5 changer transitions 59/109 dead transitions. [2022-12-06 06:26:54,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 1111 flow [2022-12-06 06:26:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:26:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:26:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 06:26:54,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-06 06:26:54,949 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 640 flow. Second operand 6 states and 60 transitions. [2022-12-06 06:26:54,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 1111 flow [2022-12-06 06:26:54,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 1083 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:54,965 INFO L231 Difference]: Finished difference. Result has 78 places, 35 transitions, 251 flow [2022-12-06 06:26:54,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=78, PETRI_TRANSITIONS=35} [2022-12-06 06:26:54,966 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-06 06:26:54,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:54,966 INFO L89 Accepts]: Start accepts. Operand has 78 places, 35 transitions, 251 flow [2022-12-06 06:26:54,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:54,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:54,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 35 transitions, 251 flow [2022-12-06 06:26:54,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 35 transitions, 251 flow [2022-12-06 06:26:54,982 INFO L130 PetriNetUnfolder]: 29/94 cut-off events. [2022-12-06 06:26:54,982 INFO L131 PetriNetUnfolder]: For 512/553 co-relation queries the response was YES. [2022-12-06 06:26:54,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 94 events. 29/94 cut-off events. For 512/553 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 331 event pairs, 1 based on Foata normal form. 8/97 useless extension candidates. Maximal degree in co-relation 343. Up to 28 conditions per place. [2022-12-06 06:26:54,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 35 transitions, 251 flow [2022-12-06 06:26:54,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 06:26:54,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] L770-->L773: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [407] $Ultimate##0-->L785: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_15 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] [2022-12-06 06:26:55,271 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:26:55,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-06 06:26:55,272 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 30 transitions, 219 flow [2022-12-06 06:26:55,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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:26:55,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:55,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:55,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:26:55,273 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1474489707, now seen corresponding path program 1 times [2022-12-06 06:26:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:55,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811777169] [2022-12-06 06:26:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:55,783 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:26:55,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:55,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811777169] [2022-12-06 06:26:55,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811777169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:55,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:55,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:26:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690599207] [2022-12-06 06:26:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:55,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:55,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:26:55,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 30 transitions, 219 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:26:55,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:55,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:26:55,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:55,874 INFO L130 PetriNetUnfolder]: 74/144 cut-off events. [2022-12-06 06:26:55,874 INFO L131 PetriNetUnfolder]: For 819/819 co-relation queries the response was YES. [2022-12-06 06:26:55,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 144 events. 74/144 cut-off events. For 819/819 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 427 event pairs, 5 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 645. Up to 66 conditions per place. [2022-12-06 06:26:55,875 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 32 selfloop transitions, 2 changer transitions 29/63 dead transitions. [2022-12-06 06:26:55,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 562 flow [2022-12-06 06:26:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:26:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:26:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 06:26:55,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-06 06:26:55,876 INFO L175 Difference]: Start difference. First operand has 63 places, 30 transitions, 219 flow. Second operand 5 states and 32 transitions. [2022-12-06 06:26:55,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 562 flow [2022-12-06 06:26:55,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 475 flow, removed 29 selfloop flow, removed 19 redundant places. [2022-12-06 06:26:55,879 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 169 flow [2022-12-06 06:26:55,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-06 06:26:55,880 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 06:26:55,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:55,880 INFO L89 Accepts]: Start accepts. Operand has 50 places, 30 transitions, 169 flow [2022-12-06 06:26:55,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:55,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:55,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 30 transitions, 169 flow [2022-12-06 06:26:55,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 169 flow [2022-12-06 06:26:55,886 INFO L130 PetriNetUnfolder]: 17/46 cut-off events. [2022-12-06 06:26:55,886 INFO L131 PetriNetUnfolder]: For 73/76 co-relation queries the response was YES. [2022-12-06 06:26:55,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 46 events. 17/46 cut-off events. For 73/76 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 86 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 132. Up to 14 conditions per place. [2022-12-06 06:26:55,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 169 flow [2022-12-06 06:26:55,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 06:26:56,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L801: Formula: (let ((.cse5 (= 0 (mod v_~z$r_buff1_thd3~0_140 256))) (.cse7 (= (mod v_~z$r_buff0_thd3~0_135 256) 0))) (let ((.cse9 (not .cse7)) (.cse10 (and (= 0 (mod v_~z$w_buff1_used~0_301 256)) .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_351 256) 0)) (.cse8 (and .cse7 .cse5))) (let ((.cse1 (or .cse10 .cse11 .cse8)) (.cse2 (and .cse9 (not .cse11))) (.cse3 (= (mod v_~z$w_buff1_used~0_300 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_76 256) 0))) (.cse6 (= (mod v_~z$w_buff0_used~0_350 256) 0))) (and (= v_~z$w_buff0_used~0_350 (ite .cse0 v_~z$w_buff0_used~0_351 (ite .cse1 v_~z$w_buff0_used~0_351 (ite .cse2 0 v_~z$w_buff0_used~0_351)))) (= v_~z~0_260 (ite .cse0 v_~z$mem_tmp~0_64 v_~__unbuffered_p2_EAX~0_96)) (= (ite .cse0 v_~z$r_buff1_thd3~0_140 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_134 256) 0))) (or (and .cse3 .cse4) (and .cse4 .cse5) .cse6)) v_~z$r_buff1_thd3~0_140 0)) v_~z$r_buff1_thd3~0_139) (= v_~weak$$choice0~0_49 |v_P2Thread1of1ForFork0_#t~nondet3_62|) (= (ite .cse1 v_~z~0_261 (ite .cse2 v_~z$w_buff0~0_232 v_~z$w_buff1~0_195)) v_~__unbuffered_p2_EAX~0_96) (= v_~z$w_buff0~0_232 v_~z$w_buff0~0_231) (= v_~z$r_buff0_thd3~0_134 (ite .cse0 v_~z$r_buff0_thd3~0_135 (ite (or (and .cse7 .cse3) .cse8 .cse6) v_~z$r_buff0_thd3~0_135 (ite (and .cse9 (not .cse6)) 0 v_~z$r_buff0_thd3~0_135)))) (= v_~weak$$choice2~0_76 |v_P2Thread1of1ForFork0_#t~nondet4_62|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~z$w_buff1~0_195 v_~z$w_buff1~0_194) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~x~0_53 1) (= (ite .cse0 v_~z$w_buff1_used~0_301 (ite (or .cse10 .cse8 .cse6) v_~z$w_buff1_used~0_301 0)) v_~z$w_buff1_used~0_300) (= v_~y~0_91 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= v_~z$flush_delayed~0_69 0) (= v_~z$mem_tmp~0_64 v_~z~0_261) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_351, ~z$w_buff0~0=v_~z$w_buff0~0_232, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_140, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_301, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_62|, ~z$w_buff1~0=v_~z$w_buff1~0_195, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_62|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_135, ~z~0=v_~z~0_261, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_64, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_350, ~z$w_buff0~0=v_~z$w_buff0~0_231, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_139, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_300, ~z$w_buff1~0=v_~z$w_buff1~0_194, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, ~weak$$choice0~0=v_~weak$$choice0~0_49, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_134, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~z~0=v_~z~0_260, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_76, ~y~0=v_~y~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[~z$mem_tmp~0, P1Thread1of1ForFork3_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, P1Thread1of1ForFork3_~arg.offset, ~weak$$choice0~0, P2Thread1of1ForFork0_~arg.base, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, ~y~0, ~x~0] and [483] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_139 (+ v_~__unbuffered_cnt~0_140 1)) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 06:26:56,902 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:26:56,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1023 [2022-12-06 06:26:56,903 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 194 flow [2022-12-06 06:26:56,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:26:56,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:56,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:56,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:26:56,904 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:56,904 INFO L85 PathProgramCache]: Analyzing trace with hash 855432195, now seen corresponding path program 1 times [2022-12-06 06:26:56,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:56,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798871751] [2022-12-06 06:26:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:26:56,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:26:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:26:57,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:26:57,039 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:26:57,040 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:26:57,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:26:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:26:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:26:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:26:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:26:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:26:57,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:26:57,042 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:57,048 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:26:57,048 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:26:57,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:26:57 BasicIcfg [2022-12-06 06:26:57,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:26:57,100 INFO L158 Benchmark]: Toolchain (without parser) took 23790.47ms. Allocated memory was 221.2MB in the beginning and 762.3MB in the end (delta: 541.1MB). Free memory was 197.4MB in the beginning and 255.3MB in the end (delta: -57.9MB). Peak memory consumption was 484.4MB. Max. memory is 8.0GB. [2022-12-06 06:26:57,100 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 221.2MB. Free memory is still 199.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:26:57,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.60ms. Allocated memory is still 221.2MB. Free memory was 197.1MB in the beginning and 169.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:26:57,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.42ms. Allocated memory is still 221.2MB. Free memory was 169.9MB in the beginning and 167.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:26:57,101 INFO L158 Benchmark]: Boogie Preprocessor took 43.25ms. Allocated memory is still 221.2MB. Free memory was 167.2MB in the beginning and 165.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:26:57,101 INFO L158 Benchmark]: RCFGBuilder took 810.08ms. Allocated memory is still 221.2MB. Free memory was 165.7MB in the beginning and 134.7MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 06:26:57,101 INFO L158 Benchmark]: TraceAbstraction took 22329.82ms. Allocated memory was 221.2MB in the beginning and 762.3MB in the end (delta: 541.1MB). Free memory was 133.7MB in the beginning and 255.3MB in the end (delta: -121.6MB). Peak memory consumption was 420.5MB. Max. memory is 8.0GB. [2022-12-06 06:26:57,102 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.14ms. Allocated memory is still 221.2MB. Free memory is still 199.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.60ms. Allocated memory is still 221.2MB. Free memory was 197.1MB in the beginning and 169.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.42ms. Allocated memory is still 221.2MB. Free memory was 169.9MB in the beginning and 167.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.25ms. Allocated memory is still 221.2MB. Free memory was 167.2MB in the beginning and 165.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 810.08ms. Allocated memory is still 221.2MB. Free memory was 165.7MB in the beginning and 134.7MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22329.82ms. Allocated memory was 221.2MB in the beginning and 762.3MB in the end (delta: 541.1MB). Free memory was 133.7MB in the beginning and 255.3MB in the end (delta: -121.6MB). Peak memory consumption was 420.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2368, independent: 2306, independent conditional: 2306, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2368, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2368, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2368, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1839, independent: 1795, independent conditional: 0, independent unconditional: 1795, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1839, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2368, independent: 511, independent conditional: 0, independent unconditional: 511, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1839, unknown conditional: 0, unknown unconditional: 1839] , Statistics on independence cache: Total cache size (in pairs): 3185, Positive cache size: 3141, Positive conditional cache size: 0, Positive unconditional cache size: 3141, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 128, 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: 152, independent: 128, independent conditional: 7, independent unconditional: 121, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 128, independent conditional: 7, independent unconditional: 121, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 7, independent unconditional: 121, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 137, independent: 117, independent conditional: 6, independent unconditional: 111, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 94, dependent conditional: 23, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 137, unknown conditional: 9, unknown unconditional: 128] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 117, Positive conditional cache size: 6, Positive unconditional cache size: 111, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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, 38 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 150, independent conditional: 28, independent unconditional: 122, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 24, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 139, Positive conditional cache size: 6, Positive unconditional cache size: 133, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 240, independent conditional: 240, 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: 260, independent: 240, independent conditional: 36, independent unconditional: 204, 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: 260, independent: 240, independent conditional: 0, independent unconditional: 240, 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: 260, independent: 240, independent conditional: 0, independent unconditional: 240, 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: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 156, Positive conditional cache size: 6, Positive unconditional cache size: 150, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, independent: 294, independent conditional: 294, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 320, independent: 294, independent conditional: 43, independent unconditional: 251, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 320, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 156, Positive conditional cache size: 6, Positive unconditional cache size: 150, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 49 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 718 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 383, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 383, independent: 347, independent conditional: 176, independent unconditional: 171, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 383, independent: 347, independent conditional: 118, independent unconditional: 229, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 383, independent: 347, independent conditional: 118, independent unconditional: 229, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, 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: 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: 383, independent: 342, independent conditional: 115, independent unconditional: 227, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 12, Positive unconditional cache size: 167, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 362, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 362, independent: 324, independent conditional: 142, independent unconditional: 182, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 362, independent: 324, independent conditional: 90, independent unconditional: 234, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 362, independent: 324, independent conditional: 90, independent unconditional: 234, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 362, independent: 322, independent conditional: 88, independent unconditional: 234, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 181, Positive conditional cache size: 14, Positive unconditional cache size: 167, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 325, independent: 289, independent conditional: 289, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 325, independent: 289, independent conditional: 141, independent unconditional: 148, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 325, independent: 289, independent conditional: 87, independent unconditional: 202, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 325, independent: 289, independent conditional: 87, independent unconditional: 202, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 325, independent: 287, independent conditional: 85, independent unconditional: 202, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 183, Positive conditional cache size: 16, Positive unconditional cache size: 167, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, 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, 59 PlacesBefore, 59 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 102, independent conditional: 102, 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: 122, independent: 102, independent conditional: 55, independent unconditional: 47, dependent: 20, dependent conditional: 17, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 102, independent conditional: 20, independent unconditional: 82, 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: 122, independent: 102, independent conditional: 20, independent unconditional: 82, 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: 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: 122, independent: 102, independent conditional: 20, independent unconditional: 82, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 183, Positive conditional cache size: 16, Positive unconditional cache size: 167, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 75 PlacesBefore, 75 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 34, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 57, independent conditional: 6, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 6, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 57, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 210, Positive conditional cache size: 16, Positive unconditional cache size: 194, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 79 PlacesBefore, 76 PlacesAfterwards, 116 TransitionsBefore, 113 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 25, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 221, Positive conditional cache size: 16, Positive unconditional cache size: 205, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 221, Positive conditional cache size: 16, Positive unconditional cache size: 205, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, 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.2s, 71 PlacesBefore, 71 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 229, Positive conditional cache size: 16, Positive unconditional cache size: 213, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, 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, 73 PlacesBefore, 73 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 229, Positive conditional cache size: 16, Positive unconditional cache size: 213, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, 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.3s, 73 PlacesBefore, 63 PlacesAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 29, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 293, Positive conditional cache size: 16, Positive unconditional cache size: 277, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 48 PlacesBefore, 46 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 35, independent conditional: 34, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 34, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 35, independent: 35, independent conditional: 34, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 380, Positive conditional cache size: 16, Positive unconditional cache size: 364, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1029, ((void *)0), P0, ((void *)0))=-2, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1030, ((void *)0), P1, ((void *)0))=-1, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1031, ((void *)0), P2, ((void *)0))=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1032, ((void *)0), P3, ((void *)0))=1, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 [L757] 1 __unbuffered_p0_EAX = x [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 [L772] 2 y = 1 [L784] 2 y = 2 [L787] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 2 z$flush_delayed = weak$$choice2 [L790] 2 z$mem_tmp = z [L791] 2 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 2 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 2 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 2 __unbuffered_p2_EAX = z [L799] 2 z = z$flush_delayed ? z$mem_tmp : z [L800] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 863]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 521 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1557 IncrementalHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 56 mSDtfsCounter, 1557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1280occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:26:57,129 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...