/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:28:40,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:28:40,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:28:40,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:28:40,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:28:40,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:28:40,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:28:40,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:28:40,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:28:40,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:28:40,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:28:40,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:28:40,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:28:40,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:28:40,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:28:40,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:28:40,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:28:40,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:28:40,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:28:40,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:28:40,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:28:40,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:28:40,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:28:40,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:28:40,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:28:40,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:28:40,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:28:40,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:28:40,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:28:40,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:28:40,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:28:40,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:28:40,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:28:40,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:28:40,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:28:40,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:28:41,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:28:41,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:28:41,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:28:41,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:28:41,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:28:41,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:28:41,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:28:41,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:28:41,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:28:41,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:28:41,034 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:28:41,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:28:41,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:28:41,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:28:41,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:28:41,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:28:41,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:28:41,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:28:41,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:28:41,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:28:41,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:28:41,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:28:41,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:28:41,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:28:41,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:28:41,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:28:41,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:28:41,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:28:41,037 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 04:28:41,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:28:41,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:28:41,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:28:41,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:28:41,302 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:28:41,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2022-12-06 04:28:42,363 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:28:42,576 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:28:42,576 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2022-12-06 04:28:42,590 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfe402a3/dc78d70542ca4d2cbe1635cd0f4762f8/FLAG0c8bce931 [2022-12-06 04:28:42,602 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfe402a3/dc78d70542ca4d2cbe1635cd0f4762f8 [2022-12-06 04:28:42,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:28:42,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:28:42,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:28:42,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:28:42,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:28:42,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:28:42" (1/1) ... [2022-12-06 04:28:42,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdd4f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:42, skipping insertion in model container [2022-12-06 04:28:42,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:28:42" (1/1) ... [2022-12-06 04:28:42,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:28:42,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:28:42,760 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/safe014_rmo.oepc.i[993,1006] [2022-12-06 04:28:42,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:28:42,922 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:28:42,931 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/safe014_rmo.oepc.i[993,1006] [2022-12-06 04:28:42,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:42,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:42,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:28:43,014 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:28:43,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43 WrapperNode [2022-12-06 04:28:43,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:28:43,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:28:43,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:28:43,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:28:43,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,061 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 04:28:43,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:28:43,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:28:43,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:28:43,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:28:43,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,089 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:28:43,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:28:43,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:28:43,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:28:43,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (1/1) ... [2022-12-06 04:28:43,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:28:43,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:28:43,148 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 04:28:43,150 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 04:28:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:28:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:28:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:28:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:28:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:28:43,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:28:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:28:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:28:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:28:43,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:28:43,178 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 04:28:43,315 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:28:43,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:28:43,666 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:28:43,831 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:28:43,831 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:28:43,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:28:43 BoogieIcfgContainer [2022-12-06 04:28:43,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:28:43,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:28:43,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:28:43,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:28:43,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:28:42" (1/3) ... [2022-12-06 04:28:43,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fbe6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:28:43, skipping insertion in model container [2022-12-06 04:28:43,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:43" (2/3) ... [2022-12-06 04:28:43,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fbe6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:28:43, skipping insertion in model container [2022-12-06 04:28:43,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:28:43" (3/3) ... [2022-12-06 04:28:43,844 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2022-12-06 04:28:43,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:28:43,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:28:43,856 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:28:43,901 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:28:43,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:28:43,973 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:28:43,973 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:43,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 04:28:43,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:28:43,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 04:28:43,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:43,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:28:43,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 04:28:44,047 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 04:28:44,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:44,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:28:44,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:28:44,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 04:28:50,387 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 04:28:50,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:28:50,403 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;@2edbf530, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:28:50,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:28:50,407 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:28:50,407 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:50,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:50,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:50,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 125649809, now seen corresponding path program 1 times [2022-12-06 04:28:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:50,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726834655] [2022-12-06 04:28:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:50,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 04:28:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726834655] [2022-12-06 04:28:50,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726834655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:50,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:50,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699001475] [2022-12-06 04:28:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:50,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:28:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:28:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:28:50,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 04:28:50,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:50,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:50,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 04:28:50,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:50,824 INFO L130 PetriNetUnfolder]: 293/487 cut-off events. [2022-12-06 04:28:50,824 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:28:50,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 487 events. 293/487 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2049 event pairs, 293 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 969. Up to 463 conditions per place. [2022-12-06 04:28:50,833 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 16 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 04:28:50,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 79 flow [2022-12-06 04:28:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:28:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:28:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 04:28:50,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 04:28:50,843 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 23 transitions. [2022-12-06 04:28:50,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 79 flow [2022-12-06 04:28:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:50,847 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 04:28:50,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 04:28:50,852 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 04:28:50,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:50,853 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 04:28:50,855 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:50,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:50,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 04:28:50,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 04:28:50,862 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:50,862 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:50,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:28:50,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 04:28:50,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:28:50,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:50,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 04:28:50,994 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 04:28:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:50,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:50,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:50,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:28:50,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 490380053, now seen corresponding path program 1 times [2022-12-06 04:28:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907962387] [2022-12-06 04:28:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:51,223 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 04:28:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:51,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907962387] [2022-12-06 04:28:51,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907962387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:51,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:51,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536818452] [2022-12-06 04:28:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:51,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:51,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 04:28:51,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 04:28:51,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:51,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 04:28:51,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:51,305 INFO L130 PetriNetUnfolder]: 272/466 cut-off events. [2022-12-06 04:28:51,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:51,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 466 events. 272/466 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1990 event pairs, 74 based on Foata normal form. 9/471 useless extension candidates. Maximal degree in co-relation 918. Up to 325 conditions per place. [2022-12-06 04:28:51,309 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 04:28:51,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 100 flow [2022-12-06 04:28:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:28:51,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:28:51,310 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:28:51,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 100 flow [2022-12-06 04:28:51,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:28:51,312 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:51,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:28:51,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 04:28:51,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:51,314 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:51,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:51,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:51,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:51,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:51,318 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:51,318 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:51,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:51,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:51,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:28:51,321 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:51,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:28:51,322 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:51,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 04:28:51,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:51,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:51,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:28:51,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1978088254, now seen corresponding path program 1 times [2022-12-06 04:28:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883354118] [2022-12-06 04:28:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:51,497 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 04:28:51,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883354118] [2022-12-06 04:28:51,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883354118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:51,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:51,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059860834] [2022-12-06 04:28:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:51,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:51,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:51,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:51,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:51,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:51,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:51,632 INFO L130 PetriNetUnfolder]: 498/775 cut-off events. [2022-12-06 04:28:51,632 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 04:28:51,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 775 events. 498/775 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 165 based on Foata normal form. 12/783 useless extension candidates. Maximal degree in co-relation 1710. Up to 634 conditions per place. [2022-12-06 04:28:51,636 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 26 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 04:28:51,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 133 flow [2022-12-06 04:28:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:28:51,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:28:51,638 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:28:51,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 133 flow [2022-12-06 04:28:51,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:51,639 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2022-12-06 04:28:51,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-06 04:28:51,640 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 04:28:51,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:51,640 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 56 flow [2022-12-06 04:28:51,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:51,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:51,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-06 04:28:51,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 56 flow [2022-12-06 04:28:51,644 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:51,644 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:28:51,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:51,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-06 04:28:51,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 04:28:51,691 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:51,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 04:28:51,693 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2022-12-06 04:28:51,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:51,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:51,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:51,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:28:51,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1191684925, now seen corresponding path program 1 times [2022-12-06 04:28:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575741239] [2022-12-06 04:28:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:51,885 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 04:28:51,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:51,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575741239] [2022-12-06 04:28:51,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575741239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:51,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:51,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:51,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671693797] [2022-12-06 04:28:51,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:51,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:51,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:51,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:51,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:51,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 04:28:51,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:51,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:51,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 04:28:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:51,954 INFO L130 PetriNetUnfolder]: 238/435 cut-off events. [2022-12-06 04:28:51,954 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 04:28:51,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 435 events. 238/435 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2023 event pairs, 50 based on Foata normal form. 6/437 useless extension candidates. Maximal degree in co-relation 973. Up to 295 conditions per place. [2022-12-06 04:28:51,957 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:28:51,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 140 flow [2022-12-06 04:28:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:28:51,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-06 04:28:51,959 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:28:51,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 140 flow [2022-12-06 04:28:51,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:51,961 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 60 flow [2022-12-06 04:28:51,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-06 04:28:51,961 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-06 04:28:51,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:51,961 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 60 flow [2022-12-06 04:28:51,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:51,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:51,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 60 flow [2022-12-06 04:28:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 60 flow [2022-12-06 04:28:51,966 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:51,966 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:28:51,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 19 events. 0/19 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:51,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 60 flow [2022-12-06 04:28:51,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 04:28:51,967 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:51,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:28:51,968 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 60 flow [2022-12-06 04:28:51,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:51,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:51,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:51,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:28:51,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1614226215, now seen corresponding path program 1 times [2022-12-06 04:28:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:51,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295303407] [2022-12-06 04:28:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:52,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295303407] [2022-12-06 04:28:52,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295303407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:52,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:52,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:28:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306305028] [2022-12-06 04:28:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:52,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:52,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:52,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:28:52,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:52,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:52,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:52,249 INFO L130 PetriNetUnfolder]: 456/723 cut-off events. [2022-12-06 04:28:52,249 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-06 04:28:52,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 723 events. 456/723 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2826 event pairs, 296 based on Foata normal form. 9/716 useless extension candidates. Maximal degree in co-relation 1740. Up to 534 conditions per place. [2022-12-06 04:28:52,253 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 26 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 04:28:52,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 142 flow [2022-12-06 04:28:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:28:52,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:28:52,255 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 60 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:28:52,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 142 flow [2022-12-06 04:28:52,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:52,257 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 64 flow [2022-12-06 04:28:52,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 04:28:52,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 04:28:52,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:52,257 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 64 flow [2022-12-06 04:28:52,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:52,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:52,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 64 flow [2022-12-06 04:28:52,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 19 transitions, 64 flow [2022-12-06 04:28:52,262 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:52,262 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-06 04:28:52,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 19 events. 0/19 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:52,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 64 flow [2022-12-06 04:28:52,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 04:28:52,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:52,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:28:52,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 64 flow [2022-12-06 04:28:52,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:28:52,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:52,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:52,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:28:52,265 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 302358727, now seen corresponding path program 1 times [2022-12-06 04:28:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:52,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087201587] [2022-12-06 04:28:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:53,170 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 04:28:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:53,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087201587] [2022-12-06 04:28:53,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087201587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:53,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:53,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:28:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960623683] [2022-12-06 04:28:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:53,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:28:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:28:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:28:53,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:28:53,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:53,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:53,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:28:53,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:53,361 INFO L130 PetriNetUnfolder]: 292/483 cut-off events. [2022-12-06 04:28:53,361 INFO L131 PetriNetUnfolder]: For 307/307 co-relation queries the response was YES. [2022-12-06 04:28:53,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 483 events. 292/483 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1948 event pairs, 36 based on Foata normal form. 4/486 useless extension candidates. Maximal degree in co-relation 1199. Up to 276 conditions per place. [2022-12-06 04:28:53,364 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 29 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 04:28:53,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 176 flow [2022-12-06 04:28:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:28:53,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 04:28:53,366 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 64 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:28:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 176 flow [2022-12-06 04:28:53,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:53,368 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 82 flow [2022-12-06 04:28:53,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-06 04:28:53,370 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-06 04:28:53,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:53,371 INFO L89 Accepts]: Start accepts. Operand has 35 places, 21 transitions, 82 flow [2022-12-06 04:28:53,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:53,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:53,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 82 flow [2022-12-06 04:28:53,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 82 flow [2022-12-06 04:28:53,376 INFO L130 PetriNetUnfolder]: 1/23 cut-off events. [2022-12-06 04:28:53,376 INFO L131 PetriNetUnfolder]: For 28/31 co-relation queries the response was YES. [2022-12-06 04:28:53,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 23 events. 1/23 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2022-12-06 04:28:53,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 82 flow [2022-12-06 04:28:53,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 04:28:53,397 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:53,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:28:53,399 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 82 flow [2022-12-06 04:28:53,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:53,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:53,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:53,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:28:53,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 162689591, now seen corresponding path program 1 times [2022-12-06 04:28:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662808277] [2022-12-06 04:28:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:53,541 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 04:28:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:53,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662808277] [2022-12-06 04:28:53,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662808277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:53,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:53,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759043] [2022-12-06 04:28:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:53,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:53,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:53,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:53,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:53,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:53,728 INFO L130 PetriNetUnfolder]: 748/1177 cut-off events. [2022-12-06 04:28:53,728 INFO L131 PetriNetUnfolder]: For 944/959 co-relation queries the response was YES. [2022-12-06 04:28:53,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1177 events. 748/1177 cut-off events. For 944/959 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5364 event pairs, 341 based on Foata normal form. 30/1187 useless extension candidates. Maximal degree in co-relation 3001. Up to 592 conditions per place. [2022-12-06 04:28:53,734 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 2 changer transitions 19/50 dead transitions. [2022-12-06 04:28:53,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 264 flow [2022-12-06 04:28:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:28:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:28:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 04:28:53,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:28:53,736 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 82 flow. Second operand 5 states and 50 transitions. [2022-12-06 04:28:53,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 264 flow [2022-12-06 04:28:53,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:28:53,740 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 89 flow [2022-12-06 04:28:53,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2022-12-06 04:28:53,740 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-06 04:28:53,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:53,740 INFO L89 Accepts]: Start accepts. Operand has 40 places, 21 transitions, 89 flow [2022-12-06 04:28:53,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:53,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:53,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 21 transitions, 89 flow [2022-12-06 04:28:53,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 89 flow [2022-12-06 04:28:53,746 INFO L130 PetriNetUnfolder]: 2/27 cut-off events. [2022-12-06 04:28:53,750 INFO L131 PetriNetUnfolder]: For 45/49 co-relation queries the response was YES. [2022-12-06 04:28:53,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 27 events. 2/27 cut-off events. For 45/49 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 1 based on Foata normal form. 2/29 useless extension candidates. Maximal degree in co-relation 56. Up to 5 conditions per place. [2022-12-06 04:28:53,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 89 flow [2022-12-06 04:28:53,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 04:28:53,756 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:53,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:28:53,758 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 89 flow [2022-12-06 04:28:53,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:53,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:53,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:53,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:28:53,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1729860617, now seen corresponding path program 2 times [2022-12-06 04:28:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:53,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287175362] [2022-12-06 04:28:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:53,908 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 04:28:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:53,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287175362] [2022-12-06 04:28:53,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287175362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:53,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:53,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238129615] [2022-12-06 04:28:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:53,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:53,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 04:28:53,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:53,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:53,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 04:28:53,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:54,024 INFO L130 PetriNetUnfolder]: 264/482 cut-off events. [2022-12-06 04:28:54,024 INFO L131 PetriNetUnfolder]: For 594/596 co-relation queries the response was YES. [2022-12-06 04:28:54,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 482 events. 264/482 cut-off events. For 594/596 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2208 event pairs, 52 based on Foata normal form. 53/529 useless extension candidates. Maximal degree in co-relation 1357. Up to 286 conditions per place. [2022-12-06 04:28:54,027 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 36 selfloop transitions, 7 changer transitions 3/50 dead transitions. [2022-12-06 04:28:54,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 291 flow [2022-12-06 04:28:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:28:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:28:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 04:28:54,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6210526315789474 [2022-12-06 04:28:54,029 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 89 flow. Second operand 5 states and 59 transitions. [2022-12-06 04:28:54,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 291 flow [2022-12-06 04:28:54,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 279 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:54,030 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 137 flow [2022-12-06 04:28:54,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 04:28:54,031 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-06 04:28:54,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:54,031 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 137 flow [2022-12-06 04:28:54,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:54,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:54,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 137 flow [2022-12-06 04:28:54,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 137 flow [2022-12-06 04:28:54,042 INFO L130 PetriNetUnfolder]: 38/105 cut-off events. [2022-12-06 04:28:54,042 INFO L131 PetriNetUnfolder]: For 152/164 co-relation queries the response was YES. [2022-12-06 04:28:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 105 events. 38/105 cut-off events. For 152/164 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 428 event pairs, 17 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 306. Up to 66 conditions per place. [2022-12-06 04:28:54,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 137 flow [2022-12-06 04:28:54,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 04:28:54,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L839-3-->L3: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_61) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L817-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_23 (+ v_~__unbuffered_cnt~0_24 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-06 04:28:54,071 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L839-3-->L3: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_61) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [554] L780-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.base_17| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_17|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_17|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:28:54,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:54,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 04:28:54,107 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 139 flow [2022-12-06 04:28:54,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:54,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:54,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:28:54,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 892691096, now seen corresponding path program 1 times [2022-12-06 04:28:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:54,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639443502] [2022-12-06 04:28:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:54,216 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 04:28:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:54,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639443502] [2022-12-06 04:28:54,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639443502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:54,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:54,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:28:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657211712] [2022-12-06 04:28:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:54,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:28:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:28:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:28:54,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:28:54,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:54,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:28:54,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:54,329 INFO L130 PetriNetUnfolder]: 163/328 cut-off events. [2022-12-06 04:28:54,329 INFO L131 PetriNetUnfolder]: For 492/492 co-relation queries the response was YES. [2022-12-06 04:28:54,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 328 events. 163/328 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1440 event pairs, 23 based on Foata normal form. 32/354 useless extension candidates. Maximal degree in co-relation 1185. Up to 146 conditions per place. [2022-12-06 04:28:54,331 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 36 selfloop transitions, 12 changer transitions 8/60 dead transitions. [2022-12-06 04:28:54,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 409 flow [2022-12-06 04:28:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:28:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:28:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 04:28:54,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2022-12-06 04:28:54,332 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 139 flow. Second operand 6 states and 73 transitions. [2022-12-06 04:28:54,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 409 flow [2022-12-06 04:28:54,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 401 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:28:54,334 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 217 flow [2022-12-06 04:28:54,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2022-12-06 04:28:54,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 04:28:54,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:54,335 INFO L89 Accepts]: Start accepts. Operand has 48 places, 32 transitions, 217 flow [2022-12-06 04:28:54,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:54,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:54,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 32 transitions, 217 flow [2022-12-06 04:28:54,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 32 transitions, 217 flow [2022-12-06 04:28:54,344 INFO L130 PetriNetUnfolder]: 17/77 cut-off events. [2022-12-06 04:28:54,344 INFO L131 PetriNetUnfolder]: For 213/226 co-relation queries the response was YES. [2022-12-06 04:28:54,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 77 events. 17/77 cut-off events. For 213/226 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 300 event pairs, 3 based on Foata normal form. 3/76 useless extension candidates. Maximal degree in co-relation 299. Up to 49 conditions per place. [2022-12-06 04:28:54,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 32 transitions, 217 flow [2022-12-06 04:28:54,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 04:28:54,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:54,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 04:28:54,377 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 209 flow [2022-12-06 04:28:54,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:54,377 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 04:28:54,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:28:54,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash -566630212, now seen corresponding path program 1 times [2022-12-06 04:28:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:54,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990561502] [2022-12-06 04:28:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:54,488 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 04:28:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990561502] [2022-12-06 04:28:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990561502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:54,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:54,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:54,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168694438] [2022-12-06 04:28:54,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:54,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:28:54,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:54,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:28:54,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:54,616 INFO L130 PetriNetUnfolder]: 243/464 cut-off events. [2022-12-06 04:28:54,616 INFO L131 PetriNetUnfolder]: For 1236/1236 co-relation queries the response was YES. [2022-12-06 04:28:54,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 464 events. 243/464 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1988 event pairs, 68 based on Foata normal form. 6/464 useless extension candidates. Maximal degree in co-relation 1845. Up to 195 conditions per place. [2022-12-06 04:28:54,620 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 37 selfloop transitions, 2 changer transitions 26/67 dead transitions. [2022-12-06 04:28:54,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 601 flow [2022-12-06 04:28:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 04:28:54,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:28:54,623 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 209 flow. Second operand 4 states and 48 transitions. [2022-12-06 04:28:54,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 601 flow [2022-12-06 04:28:54,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 518 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:54,627 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 162 flow [2022-12-06 04:28:54,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2022-12-06 04:28:54,628 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2022-12-06 04:28:54,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:54,628 INFO L89 Accepts]: Start accepts. Operand has 51 places, 28 transitions, 162 flow [2022-12-06 04:28:54,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:54,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:54,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 28 transitions, 162 flow [2022-12-06 04:28:54,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 28 transitions, 162 flow [2022-12-06 04:28:54,641 INFO L130 PetriNetUnfolder]: 28/97 cut-off events. [2022-12-06 04:28:54,641 INFO L131 PetriNetUnfolder]: For 199/203 co-relation queries the response was YES. [2022-12-06 04:28:54,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 97 events. 28/97 cut-off events. For 199/203 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 365 event pairs, 6 based on Foata normal form. 3/94 useless extension candidates. Maximal degree in co-relation 329. Up to 40 conditions per place. [2022-12-06 04:28:54,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 28 transitions, 162 flow [2022-12-06 04:28:54,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 04:28:54,644 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:54,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 04:28:54,645 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 162 flow [2022-12-06 04:28:54,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:54,645 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 04:28:54,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:28:54,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -661023630, now seen corresponding path program 2 times [2022-12-06 04:28:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:54,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994449817] [2022-12-06 04:28:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:54,758 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 04:28:54,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:54,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994449817] [2022-12-06 04:28:54,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994449817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:54,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:54,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:28:54,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846523450] [2022-12-06 04:28:54,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:54,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:54,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:54,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:54,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:54,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:54,861 INFO L130 PetriNetUnfolder]: 259/525 cut-off events. [2022-12-06 04:28:54,861 INFO L131 PetriNetUnfolder]: For 942/942 co-relation queries the response was YES. [2022-12-06 04:28:54,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 525 events. 259/525 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2457 event pairs, 38 based on Foata normal form. 7/532 useless extension candidates. Maximal degree in co-relation 2003. Up to 308 conditions per place. [2022-12-06 04:28:54,864 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 35 selfloop transitions, 3 changer transitions 16/56 dead transitions. [2022-12-06 04:28:54,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 428 flow [2022-12-06 04:28:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:28:54,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2022-12-06 04:28:54,866 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 162 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:28:54,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 428 flow [2022-12-06 04:28:54,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 411 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:54,869 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 165 flow [2022-12-06 04:28:54,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2022-12-06 04:28:54,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2022-12-06 04:28:54,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:54,870 INFO L89 Accepts]: Start accepts. Operand has 49 places, 28 transitions, 165 flow [2022-12-06 04:28:54,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:54,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:54,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 28 transitions, 165 flow [2022-12-06 04:28:54,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 28 transitions, 165 flow [2022-12-06 04:28:54,882 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-06 04:28:54,882 INFO L131 PetriNetUnfolder]: For 185/193 co-relation queries the response was YES. [2022-12-06 04:28:54,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 85 events. 24/85 cut-off events. For 185/193 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 279 event pairs, 4 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2022-12-06 04:28:54,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 28 transitions, 165 flow [2022-12-06 04:28:54,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:28:54,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:54,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 04:28:54,924 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 169 flow [2022-12-06 04:28:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:54,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:54,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:54,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:28:54,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1895539193, now seen corresponding path program 1 times [2022-12-06 04:28:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511240921] [2022-12-06 04:28:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:55,060 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 04:28:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511240921] [2022-12-06 04:28:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511240921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:55,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:55,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:28:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574689482] [2022-12-06 04:28:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:55,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:28:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:55,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:28:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:28:55,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:28:55,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:55,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:55,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:28:55,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:55,176 INFO L130 PetriNetUnfolder]: 83/184 cut-off events. [2022-12-06 04:28:55,176 INFO L131 PetriNetUnfolder]: For 359/378 co-relation queries the response was YES. [2022-12-06 04:28:55,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 184 events. 83/184 cut-off events. For 359/378 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 674 event pairs, 11 based on Foata normal form. 26/203 useless extension candidates. Maximal degree in co-relation 730. Up to 66 conditions per place. [2022-12-06 04:28:55,178 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 23 selfloop transitions, 10 changer transitions 13/49 dead transitions. [2022-12-06 04:28:55,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 385 flow [2022-12-06 04:28:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:28:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:28:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-06 04:28:55,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45112781954887216 [2022-12-06 04:28:55,179 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 169 flow. Second operand 7 states and 60 transitions. [2022-12-06 04:28:55,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 385 flow [2022-12-06 04:28:55,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 317 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-06 04:28:55,183 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 152 flow [2022-12-06 04:28:55,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2022-12-06 04:28:55,184 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2022-12-06 04:28:55,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:55,184 INFO L89 Accepts]: Start accepts. Operand has 49 places, 25 transitions, 152 flow [2022-12-06 04:28:55,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:55,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:55,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 25 transitions, 152 flow [2022-12-06 04:28:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 25 transitions, 152 flow [2022-12-06 04:28:55,191 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 04:28:55,191 INFO L131 PetriNetUnfolder]: For 68/78 co-relation queries the response was YES. [2022-12-06 04:28:55,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 45 events. 10/45 cut-off events. For 68/78 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 89 event pairs, 0 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 150. Up to 17 conditions per place. [2022-12-06 04:28:55,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 25 transitions, 152 flow [2022-12-06 04:28:55,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 04:28:59,174 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:28:59,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3991 [2022-12-06 04:28:59,175 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 155 flow [2022-12-06 04:28:59,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:59,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:59,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:59,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:28:59,176 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:59,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1656915668, now seen corresponding path program 1 times [2022-12-06 04:28:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:59,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633052706] [2022-12-06 04:28:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:59,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:59,301 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 04:28:59,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:59,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633052706] [2022-12-06 04:28:59,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633052706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:59,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:59,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552972342] [2022-12-06 04:28:59,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:59,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:59,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:59,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:59,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:28:59,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 21 transitions, 155 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:59,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:59,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:28:59,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:59,381 INFO L130 PetriNetUnfolder]: 101/203 cut-off events. [2022-12-06 04:28:59,382 INFO L131 PetriNetUnfolder]: For 495/495 co-relation queries the response was YES. [2022-12-06 04:28:59,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 203 events. 101/203 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 726 event pairs, 50 based on Foata normal form. 1/204 useless extension candidates. Maximal degree in co-relation 848. Up to 134 conditions per place. [2022-12-06 04:28:59,383 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 20 selfloop transitions, 2 changer transitions 19/41 dead transitions. [2022-12-06 04:28:59,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 375 flow [2022-12-06 04:28:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:28:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:28:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 04:28:59,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 04:28:59,384 INFO L175 Difference]: Start difference. First operand has 43 places, 21 transitions, 155 flow. Second operand 5 states and 34 transitions. [2022-12-06 04:28:59,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 375 flow [2022-12-06 04:28:59,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 294 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-12-06 04:28:59,386 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 112 flow [2022-12-06 04:28:59,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2022-12-06 04:28:59,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-06 04:28:59,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:59,387 INFO L89 Accepts]: Start accepts. Operand has 40 places, 19 transitions, 112 flow [2022-12-06 04:28:59,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:59,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:59,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 19 transitions, 112 flow [2022-12-06 04:28:59,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 19 transitions, 112 flow [2022-12-06 04:28:59,393 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2022-12-06 04:28:59,393 INFO L131 PetriNetUnfolder]: For 69/74 co-relation queries the response was YES. [2022-12-06 04:28:59,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 25 events. 5/25 cut-off events. For 69/74 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 73. Up to 8 conditions per place. [2022-12-06 04:28:59,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 19 transitions, 112 flow [2022-12-06 04:28:59,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 04:28:59,921 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:28:59,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 534 [2022-12-06 04:28:59,921 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 122 flow [2022-12-06 04:28:59,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:59,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:59,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:59,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:28:59,922 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1555852371, now seen corresponding path program 1 times [2022-12-06 04:28:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:59,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582853148] [2022-12-06 04:28:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:28:59,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:28:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:29:00,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:29:00,016 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:29:00,017 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:29:00,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:29:00,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:29:00,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:29:00,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:29:00,019 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:00,025 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:29:00,025 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:29:00,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:29:00 BasicIcfg [2022-12-06 04:29:00,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:29:00,081 INFO L158 Benchmark]: Toolchain (without parser) took 17470.61ms. Allocated memory was 213.9MB in the beginning and 530.6MB in the end (delta: 316.7MB). Free memory was 173.8MB in the beginning and 201.3MB in the end (delta: -27.5MB). Peak memory consumption was 290.2MB. Max. memory is 8.0GB. [2022-12-06 04:29:00,081 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 213.9MB. Free memory is still 190.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:29:00,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.74ms. Allocated memory is still 213.9MB. Free memory was 173.8MB in the beginning and 147.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:29:00,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.94ms. Allocated memory is still 213.9MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:00,081 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 213.9MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:00,082 INFO L158 Benchmark]: RCFGBuilder took 741.61ms. Allocated memory is still 213.9MB. Free memory was 143.4MB in the beginning and 98.3MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:00,082 INFO L158 Benchmark]: TraceAbstraction took 16243.74ms. Allocated memory was 213.9MB in the beginning and 530.6MB in the end (delta: 316.7MB). Free memory was 97.2MB in the beginning and 201.3MB in the end (delta: -104.0MB). Peak memory consumption was 213.7MB. Max. memory is 8.0GB. [2022-12-06 04:29:00,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 213.9MB. Free memory is still 190.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.74ms. Allocated memory is still 213.9MB. Free memory was 173.8MB in the beginning and 147.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.94ms. Allocated memory is still 213.9MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 213.9MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 741.61ms. Allocated memory is still 213.9MB. Free memory was 143.4MB in the beginning and 98.3MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16243.74ms. Allocated memory was 213.9MB in the beginning and 530.6MB in the end (delta: 316.7MB). Free memory was 97.2MB in the beginning and 201.3MB in the end (delta: -104.0MB). Peak memory consumption was 213.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 118 PlacesBefore, 29 PlacesAfterwards, 109 TransitionsBefore, 20 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 748, independent: 704, independent conditional: 704, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 748, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 748, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 748, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 675, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 675, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 748, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 675, unknown conditional: 0, unknown unconditional: 675] , Statistics on independence cache: Total cache size (in pairs): 948, Positive cache size: 913, Positive conditional cache size: 0, Positive unconditional cache size: 913, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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.0s, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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.0s, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 2, independent unconditional: 32, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 2, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 34, independent conditional: 34, 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: 48, independent: 34, independent conditional: 4, independent unconditional: 30, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 34, independent conditional: 0, independent unconditional: 34, 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: 48, independent: 34, independent conditional: 0, independent unconditional: 34, 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: 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: 48, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 8, independent unconditional: 31, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 8, independent unconditional: 33, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 41, independent conditional: 8, independent unconditional: 33, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 8, independent unconditional: 33, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 17, dependent conditional: 16, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 34, independent conditional: 5, independent unconditional: 29, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 45, Positive conditional cache size: 3, Positive unconditional cache size: 42, Negative cache size: 24, Negative conditional cache size: 5, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 45, 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: 59, independent: 45, independent conditional: 18, independent unconditional: 27, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 45, independent conditional: 8, independent unconditional: 37, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 8, independent unconditional: 37, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 43, independent conditional: 6, independent unconditional: 37, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 47, Positive conditional cache size: 5, Positive unconditional cache size: 42, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 122, independent conditional: 122, 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: 148, independent: 122, independent conditional: 44, independent unconditional: 78, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 122, independent conditional: 44, independent unconditional: 78, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 122, independent conditional: 44, independent unconditional: 78, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 10, independent unconditional: 7, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, independent: 105, independent conditional: 34, independent unconditional: 71, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 18, unknown conditional: 11, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 66, Positive conditional cache size: 16, Positive unconditional cache size: 50, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 149, independent conditional: 85, independent unconditional: 64, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 149, independent conditional: 85, independent unconditional: 64, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 149, independent conditional: 85, independent unconditional: 64, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 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: 183, independent: 143, independent conditional: 79, independent unconditional: 64, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 72, Positive conditional cache size: 22, Positive unconditional cache size: 50, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 72, Positive conditional cache size: 22, Positive unconditional cache size: 50, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 48 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 18, 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: 28, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 80, Positive conditional cache size: 28, Positive unconditional cache size: 52, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 47 PlacesBefore, 43 PlacesAfterwards, 25 TransitionsBefore, 21 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 35, independent conditional: 33, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 11, unknown conditional: 9, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 113, Positive conditional cache size: 36, Positive unconditional cache size: 77, Negative cache size: 28, Negative conditional cache size: 9, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 36 PlacesBefore, 34 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 134, Positive conditional cache size: 38, Positive unconditional cache size: 96, Negative cache size: 28, Negative conditional cache size: 9, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2109, ((void *)0), P0, ((void *)0))=-1, t2109={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 pthread_t t2110; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 [L779] 1 __unbuffered_p0_EBX = x [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2110, ((void *)0), P1, ((void *)0))=0, t2109={7:0}, t2110={8:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 pthread_t t2111; [L791] 2 x = 1 [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2111, ((void *)0), P2, ((void *)0))=1, t2109={7:0}, t2110={8:0}, t2111={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 __unbuffered_p2_EAX = x [L809] 3 y = 1 [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 835]: 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: 839]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 4 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: 16.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 12 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=9, InterpolantAutomatonStates: 54, 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.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:29:00,131 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...