/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:33:39,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:33:39,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:33:39,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:33:39,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:33:39,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:33:39,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:33:39,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:33:39,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:33:39,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:33:39,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:33:39,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:33:39,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:33:39,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:33:39,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:33:39,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:33:39,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:33:39,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:33:39,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:33:39,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:33:39,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:33:39,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:33:39,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:33:39,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:33:39,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:33:39,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:33:39,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:33:39,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:33:39,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:33:39,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:33:39,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:33:39,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:33:39,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:33:39,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:33:39,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:33:39,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:33:39,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:33:39,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:33:39,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:33:39,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:33:39,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:33:39,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:33:39,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:33:39,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:33:39,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:33:39,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:33:39,971 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:33:39,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:33:39,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:33:39,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:33:39,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:33:39,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:33:39,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:33:39,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:33:39,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:33:39,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:33:39,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:33:39,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:33:39,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:33:39,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:33:39,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:33:39,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:33:39,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:33:39,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:33:39,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:33:39,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:33:39,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:33:39,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:33:39,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:33:39,975 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:33:39,975 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 07:33:40,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:33:40,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:33:40,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:33:40,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:33:40,299 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:33:40,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 07:33:41,494 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:33:41,721 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:33:41,722 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 07:33:41,728 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdca14bd/638321a682b246bb87810d051d1657ad/FLAG60fa43d01 [2022-12-06 07:33:41,738 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdca14bd/638321a682b246bb87810d051d1657ad [2022-12-06 07:33:41,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:33:41,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:33:41,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:33:41,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:33:41,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:33:41,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:33:41" (1/1) ... [2022-12-06 07:33:41,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b36effc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:41, skipping insertion in model container [2022-12-06 07:33:41,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:33:41" (1/1) ... [2022-12-06 07:33:41,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:33:41,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:33:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:41,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:41,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 07:33:41,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:33:42,006 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:33:42,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:42,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:42,073 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 07:33:42,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:33:42,097 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:33:42,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42 WrapperNode [2022-12-06 07:33:42,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:33:42,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:33:42,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:33:42,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:33:42,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,171 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-12-06 07:33:42,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:33:42,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:33:42,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:33:42,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:33:42,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,227 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:33:42,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:33:42,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:33:42,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:33:42,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (1/1) ... [2022-12-06 07:33:42,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:33:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:42,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:33:42,289 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 07:33:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:33:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:33:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:33:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:33:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:33:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:33:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:33:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:33:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:33:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:33:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:33:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:33:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:33:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:33:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:33:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:33:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:33:42,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:33:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:33:42,326 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 07:33:42,486 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:33:42,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:33:43,017 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:33:43,258 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:33:43,258 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 07:33:43,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:33:43 BoogieIcfgContainer [2022-12-06 07:33:43,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:33:43,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:33:43,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:33:43,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:33:43,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:33:41" (1/3) ... [2022-12-06 07:33:43,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b46dfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:33:43, skipping insertion in model container [2022-12-06 07:33:43,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:42" (2/3) ... [2022-12-06 07:33:43,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b46dfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:33:43, skipping insertion in model container [2022-12-06 07:33:43,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:33:43" (3/3) ... [2022-12-06 07:33:43,271 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-12-06 07:33:43,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:33:43,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:33:43,289 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:33:43,386 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 07:33:43,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 07:33:43,577 INFO L130 PetriNetUnfolder]: 37/327 cut-off events. [2022-12-06 07:33:43,577 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:33:43,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 327 events. 37/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 07:33:43,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 07:33:43,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 315 transitions, 654 flow [2022-12-06 07:33:43,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 07:33:43,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 315 transitions, 654 flow [2022-12-06 07:33:43,664 INFO L130 PetriNetUnfolder]: 37/315 cut-off events. [2022-12-06 07:33:43,664 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:33:43,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 315 events. 37/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 07:33:43,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 07:33:43,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 5184 [2022-12-06 07:33:56,976 INFO L203 LiptonReduction]: Total number of compositions: 274 [2022-12-06 07:33:56,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:33:56,992 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;@7419a713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:33:56,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 07:33:57,000 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 07:33:57,001 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:33:57,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,002 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 2 more)] === [2022-12-06 07:33:57,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1058262679, now seen corresponding path program 1 times [2022-12-06 07:33:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674963261] [2022-12-06 07:33:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,658 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 07:33:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674963261] [2022-12-06 07:33:57,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674963261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:33:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967687539] [2022-12-06 07:33:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:33:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:33:57,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:33:57,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:33:57,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 07:33:57,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:33:57,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,977 INFO L130 PetriNetUnfolder]: 501/685 cut-off events. [2022-12-06 07:33:57,977 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 07:33:57,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 685 events. 501/685 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1774 event pairs, 117 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-06 07:33:57,982 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 49 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-12-06 07:33:57,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 265 flow [2022-12-06 07:33:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:33:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:33:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 07:33:57,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2022-12-06 07:33:57,994 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 56 transitions. [2022-12-06 07:33:57,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 265 flow [2022-12-06 07:33:57,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 07:33:58,000 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 107 flow [2022-12-06 07:33:58,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-06 07:33:58,005 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-06 07:33:58,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,005 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 107 flow [2022-12-06 07:33:58,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-06 07:33:58,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 107 flow [2022-12-06 07:33:58,019 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1652] L154-1-->L154-1: Formula: (let ((.cse2 (= v_~client_state~0_In_4 1)) (.cse3 (= v_~manager_back~0_In_12 v_~manager_back~0_Out_28)) (.cse5 (= |v_thread4Thread1of1ForFork2_#t~post26#1_Out_8| |v_thread4Thread1of1ForFork2_#t~post26#1_In_3|)) (.cse8 (= |v_thread4Thread1of1ForFork2_#t~mem25#1_In_3| |v_thread4Thread1of1ForFork2_#t~mem25#1_Out_8|)) (.cse9 (= v_~client_state~0_In_4 0)) (.cse0 (= v_~safe~0_Out_36 v_~safe~0_In_10)) (.cse1 (= |v_thread4Thread1of1ForFork2_#t~mem27#1_In_3| |v_thread4Thread1of1ForFork2_#t~mem27#1_Out_8|)) (.cse4 (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1| 256) 0))) (.cse6 (= |v_thread4Thread1of1ForFork2_#t~post28#1_In_3| |v_thread4Thread1of1ForFork2_#t~post28#1_Out_8|)) (.cse10 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse7 (= v_~client_front~0_In_6 v_~client_front~0_Out_20)) (.cse11 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|))) (or (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_~client_state~0_Out_14 v_~client_state~0_In_4) (not .cse9) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|)) (and (= (ite (= (ite (= v_~ok~0_In_10 (select (select |v_#memory_int_In_42| v_~client~0.base_In_5) (+ (* v_~client_front~0_In_6 4) v_~client~0.offset_In_5))) 1 0) 0) 0 1) v_~safe~0_Out_36) .cse2 (= (+ v_~client_front~0_In_6 1) v_~client_front~0_Out_20) .cse3 .cse4 .cse5 .cse10 .cse8 .cse11 (= v_~client_state~0_Out_14 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (< v_~client_back~0_In_5 v_~client_size~0_In_6) (<= 0 v_~client_front~0_In_6) (< v_~client_front~0_In_6 v_~client_back~0_In_5)) 1 0))) (and (not (= (ite (and (<= 0 v_~manager_back~0_In_12) (< v_~manager_back~0_In_12 v_~manager_size~0_In_14)) 1 0) 0)) .cse9 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| (ite (= v_~update~0_In_14 (select (select |v_#memory_int_In_42| v_~manager~0.base_In_12) (+ (* v_~manager_back~0_In_12 4) v_~manager~0.offset_In_12))) 1 0)) .cse0 .cse1 (= v_~client_state~0_Out_14 1) .cse4 .cse6 (= v_~manager_back~0_Out_28 (+ v_~manager_back~0_In_12 1)) .cse10 .cse7 .cse11))) InVars {~client~0.offset=v_~client~0.offset_In_5, ~client_back~0=v_~client_back~0_In_5, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3|, ~manager~0.offset=v_~manager~0.offset_In_12, ~ok~0=v_~ok~0_In_10, ~manager~0.base=v_~manager~0.base_In_12, thread4Thread1of1ForFork2_#t~nondet24#1=|v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1|, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_In_3|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|, ~manager_back~0=v_~manager_back~0_In_12, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_In_3|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_In_3|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_In_3|, ~client_front~0=v_~client_front~0_In_6, ~safe~0=v_~safe~0_In_10, #memory_int=|v_#memory_int_In_42|, ~client_state~0=v_~client_state~0_In_4, ~client_size~0=v_~client_size~0_In_6, ~manager_size~0=v_~manager_size~0_In_14, ~client~0.base=v_~client~0.base_In_5, ~update~0=v_~update~0_In_14} OutVars{~client~0.offset=v_~client~0.offset_In_5, ~client_back~0=v_~client_back~0_In_5, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|, ~manager~0.offset=v_~manager~0.offset_In_12, ~ok~0=v_~ok~0_In_10, ~manager~0.base=v_~manager~0.base_In_12, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_Out_8|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, ~manager_back~0=v_~manager_back~0_Out_28, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_Out_8|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_Out_8|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_Out_8|, ~client_front~0=v_~client_front~0_Out_20, ~safe~0=v_~safe~0_Out_36, #memory_int=|v_#memory_int_In_42|, ~client_state~0=v_~client_state~0_Out_14, ~client_size~0=v_~client_size~0_In_6, ~manager_size~0=v_~manager_size~0_In_14, ~client~0.base=v_~client~0.base_In_5, ~update~0=v_~update~0_In_14} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~client_front~0, ~safe~0, thread4Thread1of1ForFork2_#t~nondet24#1, thread4Thread1of1ForFork2_#t~post26#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, ~client_state~0, thread4Thread1of1ForFork2_#t~mem27#1, thread4Thread1of1ForFork2_#t~post28#1, thread4Thread1of1ForFork2_#t~mem25#1][26], [310#true, 141#L110-1true, 80#L154-1true, 175#L132-1true, 86#L199-4true, Black: 312#(= ~safe~0 1), 89#L88-1true]) [2022-12-06 07:33:58,019 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:33:58,019 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:33:58,019 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:33:58,019 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:33:58,024 INFO L130 PetriNetUnfolder]: 23/63 cut-off events. [2022-12-06 07:33:58,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:33:58,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 63 events. 23/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-06 07:33:58,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-06 07:33:58,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 07:33:58,026 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:58,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:33:58,028 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 107 flow [2022-12-06 07:33:58,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 07:33:58,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:33:58,028 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 2 more)] === [2022-12-06 07:33:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1410111894, now seen corresponding path program 1 times [2022-12-06 07:33:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372876054] [2022-12-06 07:33:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:58,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372876054] [2022-12-06 07:33:58,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372876054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:33:58,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437357806] [2022-12-06 07:33:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:58,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:33:58,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:33:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:33:58,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:33:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:59,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:33:59,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437357806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:33:59,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2022-12-06 07:33:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492063730] [2022-12-06 07:33:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:33:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:33:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:33:59,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:33:59,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 07:33:59,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:33:59,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,291 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-06 07:33:59,292 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 07:33:59,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 647 events. 467/647 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1704 event pairs, 117 based on Foata normal form. 30/673 useless extension candidates. Maximal degree in co-relation 471. Up to 433 conditions per place. [2022-12-06 07:33:59,296 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2022-12-06 07:33:59,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 244 flow [2022-12-06 07:33:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:33:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:33:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 07:33:59,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-06 07:33:59,298 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 107 flow. Second operand 3 states and 53 transitions. [2022-12-06 07:33:59,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 244 flow [2022-12-06 07:33:59,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:33:59,300 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 106 flow [2022-12-06 07:33:59,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-06 07:33:59,301 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-06 07:33:59,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,301 INFO L89 Accepts]: Start accepts. Operand has 34 places, 36 transitions, 106 flow [2022-12-06 07:33:59,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 106 flow [2022-12-06 07:33:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 106 flow [2022-12-06 07:33:59,314 INFO L130 PetriNetUnfolder]: 18/54 cut-off events. [2022-12-06 07:33:59,314 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:33:59,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 54 events. 18/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 43. Up to 17 conditions per place. [2022-12-06 07:33:59,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 106 flow [2022-12-06 07:33:59,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:33:59,317 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:59,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:33:59,318 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 106 flow [2022-12-06 07:33:59,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 07:33:59,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:33:59,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:59,525 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 2 more)] === [2022-12-06 07:33:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash 573276739, now seen corresponding path program 1 times [2022-12-06 07:33:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038985744] [2022-12-06 07:33:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038985744] [2022-12-06 07:33:59,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038985744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:33:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383946532] [2022-12-06 07:33:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:33:59,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:33:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,274 INFO L130 PetriNetUnfolder]: 1278/1817 cut-off events. [2022-12-06 07:34:00,275 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2022-12-06 07:34:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 1817 events. 1278/1817 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6192 event pairs, 801 based on Foata normal form. 120/1926 useless extension candidates. Maximal degree in co-relation 1325. Up to 648 conditions per place. [2022-12-06 07:34:00,283 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 92 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2022-12-06 07:34:00,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 100 transitions, 482 flow [2022-12-06 07:34:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:34:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:34:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 07:34:00,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 07:34:00,285 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 106 flow. Second operand 5 states and 95 transitions. [2022-12-06 07:34:00,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 100 transitions, 482 flow [2022-12-06 07:34:00,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 100 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:34:00,288 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 164 flow [2022-12-06 07:34:00,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2022-12-06 07:34:00,289 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-06 07:34:00,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,289 INFO L89 Accepts]: Start accepts. Operand has 39 places, 43 transitions, 164 flow [2022-12-06 07:34:00,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 43 transitions, 164 flow [2022-12-06 07:34:00,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 43 transitions, 164 flow [2022-12-06 07:34:00,310 INFO L130 PetriNetUnfolder]: 37/140 cut-off events. [2022-12-06 07:34:00,311 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 07:34:00,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 140 events. 37/140 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 430 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 125. Up to 35 conditions per place. [2022-12-06 07:34:00,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 43 transitions, 164 flow [2022-12-06 07:34:00,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:34:06,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5795 [2022-12-06 07:34:06,084 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 170 flow [2022-12-06 07:34:06,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:34:06,085 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 2 more)] === [2022-12-06 07:34:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash -93352592, now seen corresponding path program 1 times [2022-12-06 07:34:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269018604] [2022-12-06 07:34:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269018604] [2022-12-06 07:34:06,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269018604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:34:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349125388] [2022-12-06 07:34:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:34:06,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 07:34:06,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:34:06,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,986 INFO L130 PetriNetUnfolder]: 2274/3257 cut-off events. [2022-12-06 07:34:06,986 INFO L131 PetriNetUnfolder]: For 1290/1290 co-relation queries the response was YES. [2022-12-06 07:34:06,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 3257 events. 2274/3257 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13307 event pairs, 777 based on Foata normal form. 204/3459 useless extension candidates. Maximal degree in co-relation 4835. Up to 1469 conditions per place. [2022-12-06 07:34:07,002 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 74 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2022-12-06 07:34:07,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 79 transitions, 434 flow [2022-12-06 07:34:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 07:34:07,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 07:34:07,006 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 170 flow. Second operand 4 states and 73 transitions. [2022-12-06 07:34:07,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 79 transitions, 434 flow [2022-12-06 07:34:07,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 79 transitions, 426 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:34:07,014 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 179 flow [2022-12-06 07:34:07,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2022-12-06 07:34:07,015 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 07:34:07,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,016 INFO L89 Accepts]: Start accepts. Operand has 43 places, 43 transitions, 179 flow [2022-12-06 07:34:07,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 43 transitions, 179 flow [2022-12-06 07:34:07,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 179 flow [2022-12-06 07:34:07,049 INFO L130 PetriNetUnfolder]: 41/189 cut-off events. [2022-12-06 07:34:07,049 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 07:34:07,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 189 events. 41/189 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 775 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 52 conditions per place. [2022-12-06 07:34:07,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 179 flow [2022-12-06 07:34:07,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:34:07,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:34:07,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 07:34:07,054 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 179 flow [2022-12-06 07:34:07,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 07:34:07,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:34:07,055 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 2 more)] === [2022-12-06 07:34:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1074394720, now seen corresponding path program 1 times [2022-12-06 07:34:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402656398] [2022-12-06 07:34:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402656398] [2022-12-06 07:34:07,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402656398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:34:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626346894] [2022-12-06 07:34:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:34:07,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 07:34:07,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:34:07,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,631 INFO L130 PetriNetUnfolder]: 1078/1592 cut-off events. [2022-12-06 07:34:07,632 INFO L131 PetriNetUnfolder]: For 1164/1164 co-relation queries the response was YES. [2022-12-06 07:34:07,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1592 events. 1078/1592 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5769 event pairs, 761 based on Foata normal form. 72/1663 useless extension candidates. Maximal degree in co-relation 3239. Up to 1168 conditions per place. [2022-12-06 07:34:07,639 INFO L137 encePairwiseOnDemand]: 32/34 looper letters, 37 selfloop transitions, 0 changer transitions 31/68 dead transitions. [2022-12-06 07:34:07,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 383 flow [2022-12-06 07:34:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:34:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:34:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 07:34:07,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 07:34:07,640 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 179 flow. Second operand 3 states and 60 transitions. [2022-12-06 07:34:07,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 383 flow [2022-12-06 07:34:07,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 372 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:34:07,646 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 132 flow [2022-12-06 07:34:07,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 07:34:07,649 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 07:34:07,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,649 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 132 flow [2022-12-06 07:34:07,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 132 flow [2022-12-06 07:34:07,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 132 flow [2022-12-06 07:34:07,665 INFO L130 PetriNetUnfolder]: 24/78 cut-off events. [2022-12-06 07:34:07,666 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:34:07,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 78 events. 24/78 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 89. Up to 28 conditions per place. [2022-12-06 07:34:07,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 37 transitions, 132 flow [2022-12-06 07:34:07,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:34:07,667 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:34:07,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 07:34:07,669 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 132 flow [2022-12-06 07:34:07,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 07:34:07,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:34:07,670 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 2 more)] === [2022-12-06 07:34:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2021498286, now seen corresponding path program 1 times [2022-12-06 07:34:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502046115] [2022-12-06 07:34:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:07,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502046115] [2022-12-06 07:34:07,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502046115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:34:07,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214370036] [2022-12-06 07:34:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:34:07,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:34:07,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,226 INFO L130 PetriNetUnfolder]: 999/1403 cut-off events. [2022-12-06 07:34:08,226 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2022-12-06 07:34:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1403 events. 999/1403 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4506 event pairs, 261 based on Foata normal form. 64/1466 useless extension candidates. Maximal degree in co-relation 3601. Up to 541 conditions per place. [2022-12-06 07:34:08,233 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 65 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-06 07:34:08,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 358 flow [2022-12-06 07:34:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 07:34:08,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:34:08,234 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 132 flow. Second operand 4 states and 66 transitions. [2022-12-06 07:34:08,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 358 flow [2022-12-06 07:34:08,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 344 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:34:08,236 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 130 flow [2022-12-06 07:34:08,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 07:34:08,237 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 07:34:08,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:08,237 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 130 flow [2022-12-06 07:34:08,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:08,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:08,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 130 flow [2022-12-06 07:34:08,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 130 flow [2022-12-06 07:34:08,252 INFO L130 PetriNetUnfolder]: 18/76 cut-off events. [2022-12-06 07:34:08,252 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 07:34:08,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 76 events. 18/76 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 1 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 76. Up to 25 conditions per place. [2022-12-06 07:34:08,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 130 flow [2022-12-06 07:34:08,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:34:08,253 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:34:08,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:34:08,254 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 130 flow [2022-12-06 07:34:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:34:08,255 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 2 more)] === [2022-12-06 07:34:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash -336909090, now seen corresponding path program 1 times [2022-12-06 07:34:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591675698] [2022-12-06 07:34:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:08,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591675698] [2022-12-06 07:34:08,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591675698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:08,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011929543] [2022-12-06 07:34:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:08,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:08,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:08,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:34:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:34:08,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:08,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:34:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:08,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011929543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:34:08,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:34:08,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 07:34:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696281790] [2022-12-06 07:34:08,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:34:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:34:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:34:08,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:34:08,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 130 flow. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 07:34:08,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:34:08,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,188 INFO L130 PetriNetUnfolder]: 1127/1592 cut-off events. [2022-12-06 07:34:09,188 INFO L131 PetriNetUnfolder]: For 1202/1202 co-relation queries the response was YES. [2022-12-06 07:34:09,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 1592 events. 1127/1592 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5455 event pairs, 277 based on Foata normal form. 1/1589 useless extension candidates. Maximal degree in co-relation 1293. Up to 1205 conditions per place. [2022-12-06 07:34:09,196 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 56 selfloop transitions, 4 changer transitions 3/63 dead transitions. [2022-12-06 07:34:09,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 328 flow [2022-12-06 07:34:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 07:34:09,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-06 07:34:09,198 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 130 flow. Second operand 4 states and 61 transitions. [2022-12-06 07:34:09,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 328 flow [2022-12-06 07:34:09,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:34:09,201 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 158 flow [2022-12-06 07:34:09,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-06 07:34:09,202 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 07:34:09,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,202 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 158 flow [2022-12-06 07:34:09,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 158 flow [2022-12-06 07:34:09,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 158 flow [2022-12-06 07:34:09,219 INFO L130 PetriNetUnfolder]: 19/80 cut-off events. [2022-12-06 07:34:09,219 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 07:34:09,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 80 events. 19/80 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 1 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 90. Up to 27 conditions per place. [2022-12-06 07:34:09,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 158 flow [2022-12-06 07:34:09,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 07:34:09,223 WARN L322 ript$VariableManager]: TermVariable LBE356 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:09,223 WARN L322 ript$VariableManager]: TermVariable LBE774 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:09,223 WARN L322 ript$VariableManager]: TermVariable LBE344 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:09,223 WARN L322 ript$VariableManager]: TermVariable LBE376 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:09,223 WARN L322 ript$VariableManager]: TermVariable LBE839 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:09,223 WARN L322 ript$VariableManager]: TermVariable LBE799 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:09,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 07:34:09,910 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 159 flow [2022-12-06 07:34:09,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 07:34:09,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:34:10,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 07:34:10,117 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 2 more)] === [2022-12-06 07:34:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 729180131, now seen corresponding path program 1 times [2022-12-06 07:34:10,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137823866] [2022-12-06 07:34:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137823866] [2022-12-06 07:34:10,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137823866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:34:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644169589] [2022-12-06 07:34:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:34:10,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:34:10,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,781 INFO L130 PetriNetUnfolder]: 969/1372 cut-off events. [2022-12-06 07:34:10,782 INFO L131 PetriNetUnfolder]: For 1294/1294 co-relation queries the response was YES. [2022-12-06 07:34:10,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1372 events. 969/1372 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4508 event pairs, 397 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 854. Up to 1158 conditions per place. [2022-12-06 07:34:10,788 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 38 selfloop transitions, 2 changer transitions 9/49 dead transitions. [2022-12-06 07:34:10,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 264 flow [2022-12-06 07:34:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:34:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:34:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 07:34:10,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 07:34:10,789 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 159 flow. Second operand 3 states and 47 transitions. [2022-12-06 07:34:10,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 264 flow [2022-12-06 07:34:10,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 256 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,792 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 134 flow [2022-12-06 07:34:10,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 07:34:10,794 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 07:34:10,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,794 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 134 flow [2022-12-06 07:34:10,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 134 flow [2022-12-06 07:34:10,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 134 flow [2022-12-06 07:34:10,810 INFO L130 PetriNetUnfolder]: 17/74 cut-off events. [2022-12-06 07:34:10,810 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 07:34:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 74 events. 17/74 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 1 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 104. Up to 22 conditions per place. [2022-12-06 07:34:10,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 134 flow [2022-12-06 07:34:10,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:34:10,811 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:34:10,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:34:10,812 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 134 flow [2022-12-06 07:34:10,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:34:10,813 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 2 more)] === [2022-12-06 07:34:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2018565861, now seen corresponding path program 1 times [2022-12-06 07:34:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408230800] [2022-12-06 07:34:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408230800] [2022-12-06 07:34:12,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408230800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:12,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309589950] [2022-12-06 07:34:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:12,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:12,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:12,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:34:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 07:34:12,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:12,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:34:12,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:12,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:12,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:12,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:12,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:34:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309589950] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:34:16,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:34:16,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2022-12-06 07:34:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79823374] [2022-12-06 07:34:16,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:34:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:34:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=406, Unknown=15, NotChecked=0, Total=552 [2022-12-06 07:34:16,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:34:16,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 134 flow. Second operand has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 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 07:34:16,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:34:16,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,840 INFO L130 PetriNetUnfolder]: 2403/3550 cut-off events. [2022-12-06 07:34:21,841 INFO L131 PetriNetUnfolder]: For 2437/2437 co-relation queries the response was YES. [2022-12-06 07:34:21,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9444 conditions, 3550 events. 2403/3550 cut-off events. For 2437/2437 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16012 event pairs, 522 based on Foata normal form. 3/3536 useless extension candidates. Maximal degree in co-relation 4121. Up to 1436 conditions per place. [2022-12-06 07:34:21,857 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 131 selfloop transitions, 42 changer transitions 71/244 dead transitions. [2022-12-06 07:34:21,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 244 transitions, 1190 flow [2022-12-06 07:34:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 07:34:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 07:34:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2022-12-06 07:34:21,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3347107438016529 [2022-12-06 07:34:21,860 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 134 flow. Second operand 22 states and 243 transitions. [2022-12-06 07:34:21,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 244 transitions, 1190 flow [2022-12-06 07:34:21,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 244 transitions, 1178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:34:21,869 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 500 flow [2022-12-06 07:34:21,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=500, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2022-12-06 07:34:21,870 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-06 07:34:21,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,871 INFO L89 Accepts]: Start accepts. Operand has 74 places, 77 transitions, 500 flow [2022-12-06 07:34:21,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 500 flow [2022-12-06 07:34:21,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 500 flow [2022-12-06 07:34:21,926 INFO L130 PetriNetUnfolder]: 108/452 cut-off events. [2022-12-06 07:34:21,926 INFO L131 PetriNetUnfolder]: For 324/326 co-relation queries the response was YES. [2022-12-06 07:34:21,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 452 events. 108/452 cut-off events. For 324/326 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2722 event pairs, 47 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1061. Up to 100 conditions per place. [2022-12-06 07:34:21,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 500 flow [2022-12-06 07:34:21,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 07:34:36,931 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,931 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,932 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:36,933 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:52,332 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:34:52,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30463 [2022-12-06 07:34:52,333 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 521 flow [2022-12-06 07:34:52,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 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 07:34:52,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,334 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:34:52,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:52,540 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 2 more)] === [2022-12-06 07:34:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1760833152, now seen corresponding path program 1 times [2022-12-06 07:34:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250240696] [2022-12-06 07:34:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:53,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250240696] [2022-12-06 07:34:53,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250240696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:53,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207621373] [2022-12-06 07:34:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:53,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:53,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:53,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:34:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:34:53,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:53,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:34:55,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:34:55,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 685 treesize of output 850 [2022-12-06 07:35:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:00,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207621373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:00,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:00,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:35:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291062647] [2022-12-06 07:35:00,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:35:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:35:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:35:00,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:00,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 521 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 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 07:35:00,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,681 INFO L130 PetriNetUnfolder]: 3839/5601 cut-off events. [2022-12-06 07:35:02,681 INFO L131 PetriNetUnfolder]: For 11508/11508 co-relation queries the response was YES. [2022-12-06 07:35:02,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19662 conditions, 5601 events. 3839/5601 cut-off events. For 11508/11508 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26638 event pairs, 642 based on Foata normal form. 360/5960 useless extension candidates. Maximal degree in co-relation 17702. Up to 1469 conditions per place. [2022-12-06 07:35:02,714 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 138 selfloop transitions, 37 changer transitions 35/210 dead transitions. [2022-12-06 07:35:02,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 210 transitions, 1530 flow [2022-12-06 07:35:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:35:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:35:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2022-12-06 07:35:02,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2022-12-06 07:35:02,716 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 521 flow. Second operand 12 states and 176 transitions. [2022-12-06 07:35:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 210 transitions, 1530 flow [2022-12-06 07:35:02,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 210 transitions, 1490 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 07:35:02,736 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 729 flow [2022-12-06 07:35:02,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2022-12-06 07:35:02,737 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2022-12-06 07:35:02,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,737 INFO L89 Accepts]: Start accepts. Operand has 88 places, 89 transitions, 729 flow [2022-12-06 07:35:02,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 89 transitions, 729 flow [2022-12-06 07:35:02,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 89 transitions, 729 flow [2022-12-06 07:35:02,805 INFO L130 PetriNetUnfolder]: 140/592 cut-off events. [2022-12-06 07:35:02,806 INFO L131 PetriNetUnfolder]: For 776/796 co-relation queries the response was YES. [2022-12-06 07:35:02,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 592 events. 140/592 cut-off events. For 776/796 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3867 event pairs, 58 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 1546. Up to 128 conditions per place. [2022-12-06 07:35:02,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 89 transitions, 729 flow [2022-12-06 07:35:02,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-06 07:35:15,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1659] L110-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork3_#t~nondet14#1=|v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1|} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_Out_4|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#t~nondet14#1] and [1611] L198-4-->L199-3: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t4~0#1.base_21| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t4~0#1.base_21|) |v_ULTIMATE.start_main_~#t4~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre49#1_25|)) |v_#memory_int_281|) (= |v_#pthreadsForks_56| |v_ULTIMATE.start_main_#t~pre49#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_282|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_21|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_25|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_15|, #memory_int=|v_#memory_int_281|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_21|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_21|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet48#1, #memory_int, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 07:35:15,129 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:35:15,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12392 [2022-12-06 07:35:15,130 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 752 flow [2022-12-06 07:35:15,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 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 07:35:15,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:35:15,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:15,335 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 2 more)] === [2022-12-06 07:35:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2097075205, now seen corresponding path program 1 times [2022-12-06 07:35:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081963614] [2022-12-06 07:35:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081963614] [2022-12-06 07:35:15,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081963614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130159409] [2022-12-06 07:35:15,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:35:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:35:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:35:15,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:35:15,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 752 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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 07:35:15,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:35:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,180 INFO L130 PetriNetUnfolder]: 5292/7965 cut-off events. [2022-12-06 07:35:17,180 INFO L131 PetriNetUnfolder]: For 23346/23346 co-relation queries the response was YES. [2022-12-06 07:35:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29529 conditions, 7965 events. 5292/7965 cut-off events. For 23346/23346 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42362 event pairs, 2803 based on Foata normal form. 16/7979 useless extension candidates. Maximal degree in co-relation 28527. Up to 3894 conditions per place. [2022-12-06 07:35:17,225 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 105 selfloop transitions, 27 changer transitions 25/157 dead transitions. [2022-12-06 07:35:17,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 157 transitions, 1423 flow [2022-12-06 07:35:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:35:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:35:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 07:35:17,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:17,227 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 752 flow. Second operand 6 states and 105 transitions. [2022-12-06 07:35:17,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 157 transitions, 1423 flow [2022-12-06 07:35:17,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 1358 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,282 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 869 flow [2022-12-06 07:35:17,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2022-12-06 07:35:17,283 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2022-12-06 07:35:17,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,283 INFO L89 Accepts]: Start accepts. Operand has 91 places, 97 transitions, 869 flow [2022-12-06 07:35:17,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 97 transitions, 869 flow [2022-12-06 07:35:17,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 869 flow [2022-12-06 07:35:17,366 INFO L130 PetriNetUnfolder]: 209/992 cut-off events. [2022-12-06 07:35:17,366 INFO L131 PetriNetUnfolder]: For 1164/1194 co-relation queries the response was YES. [2022-12-06 07:35:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 992 events. 209/992 cut-off events. For 1164/1194 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8032 event pairs, 117 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 2542. Up to 240 conditions per place. [2022-12-06 07:35:17,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 97 transitions, 869 flow [2022-12-06 07:35:17,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-06 07:35:17,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:17,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:35:17,378 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 869 flow [2022-12-06 07:35:17,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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 07:35:17,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:35:17,379 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 2 more)] === [2022-12-06 07:35:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 346501392, now seen corresponding path program 1 times [2022-12-06 07:35:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815524399] [2022-12-06 07:35:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:17,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815524399] [2022-12-06 07:35:17,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815524399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:17,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771889068] [2022-12-06 07:35:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:17,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:17,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:17,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:35:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:35:17,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:18,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:18,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:18,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 07:35:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:20,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771889068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:20,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:20,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 07:35:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163144573] [2022-12-06 07:35:20,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:35:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:35:20,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:35:20,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:20,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 869 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 07:35:20,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:20,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,223 INFO L130 PetriNetUnfolder]: 8118/12267 cut-off events. [2022-12-06 07:35:22,224 INFO L131 PetriNetUnfolder]: For 38673/38673 co-relation queries the response was YES. [2022-12-06 07:35:22,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44471 conditions, 12267 events. 8118/12267 cut-off events. For 38673/38673 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 70639 event pairs, 3189 based on Foata normal form. 672/12938 useless extension candidates. Maximal degree in co-relation 43532. Up to 2847 conditions per place. [2022-12-06 07:35:22,281 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 181 selfloop transitions, 59 changer transitions 18/258 dead transitions. [2022-12-06 07:35:22,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 258 transitions, 2278 flow [2022-12-06 07:35:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:35:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:35:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2022-12-06 07:35:22,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.388560157790927 [2022-12-06 07:35:22,283 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 869 flow. Second operand 13 states and 197 transitions. [2022-12-06 07:35:22,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 258 transitions, 2278 flow [2022-12-06 07:35:22,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 258 transitions, 2244 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:35:22,372 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1133 flow [2022-12-06 07:35:22,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1133, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2022-12-06 07:35:22,373 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-06 07:35:22,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,373 INFO L89 Accepts]: Start accepts. Operand has 104 places, 108 transitions, 1133 flow [2022-12-06 07:35:22,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 108 transitions, 1133 flow [2022-12-06 07:35:22,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 108 transitions, 1133 flow [2022-12-06 07:35:22,598 INFO L130 PetriNetUnfolder]: 262/1373 cut-off events. [2022-12-06 07:35:22,599 INFO L131 PetriNetUnfolder]: For 1941/1993 co-relation queries the response was YES. [2022-12-06 07:35:22,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1373 events. 262/1373 cut-off events. For 1941/1993 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12267 event pairs, 152 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 3578. Up to 326 conditions per place. [2022-12-06 07:35:22,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 108 transitions, 1133 flow [2022-12-06 07:35:22,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-06 07:35:22,611 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:22,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 07:35:22,612 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 1133 flow [2022-12-06 07:35:22,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 07:35:22,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:22,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 07:35:22,814 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 2 more)] === [2022-12-06 07:35:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1635500227, now seen corresponding path program 1 times [2022-12-06 07:35:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7686479] [2022-12-06 07:35:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:23,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7686479] [2022-12-06 07:35:23,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7686479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868321102] [2022-12-06 07:35:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:23,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:23,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:35:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:35:23,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:24,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:24,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:24,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 07:35:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:26,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868321102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:26,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:26,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-12-06 07:35:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077905900] [2022-12-06 07:35:26,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:35:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:35:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:35:26,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:26,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 1133 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 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 07:35:26,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:26,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,996 INFO L130 PetriNetUnfolder]: 7277/11112 cut-off events. [2022-12-06 07:35:27,997 INFO L131 PetriNetUnfolder]: For 34988/34988 co-relation queries the response was YES. [2022-12-06 07:35:28,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40673 conditions, 11112 events. 7277/11112 cut-off events. For 34988/34988 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 63862 event pairs, 3500 based on Foata normal form. 168/11279 useless extension candidates. Maximal degree in co-relation 39934. Up to 4933 conditions per place. [2022-12-06 07:35:28,052 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 78 selfloop transitions, 40 changer transitions 24/142 dead transitions. [2022-12-06 07:35:28,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1425 flow [2022-12-06 07:35:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:35:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:35:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 07:35:28,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34798534798534797 [2022-12-06 07:35:28,053 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 1133 flow. Second operand 7 states and 95 transitions. [2022-12-06 07:35:28,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1425 flow [2022-12-06 07:35:28,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 142 transitions, 1377 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 07:35:28,280 INFO L231 Difference]: Finished difference. Result has 102 places, 88 transitions, 934 flow [2022-12-06 07:35:28,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=934, PETRI_PLACES=102, PETRI_TRANSITIONS=88} [2022-12-06 07:35:28,281 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-06 07:35:28,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,282 INFO L89 Accepts]: Start accepts. Operand has 102 places, 88 transitions, 934 flow [2022-12-06 07:35:28,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 88 transitions, 934 flow [2022-12-06 07:35:28,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 934 flow [2022-12-06 07:35:28,444 INFO L130 PetriNetUnfolder]: 240/1251 cut-off events. [2022-12-06 07:35:28,444 INFO L131 PetriNetUnfolder]: For 1773/1813 co-relation queries the response was YES. [2022-12-06 07:35:28,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1251 events. 240/1251 cut-off events. For 1773/1813 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10879 event pairs, 144 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 3240. Up to 301 conditions per place. [2022-12-06 07:35:28,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 88 transitions, 934 flow [2022-12-06 07:35:28,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 07:35:28,458 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:28,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:28,459 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 934 flow [2022-12-06 07:35:28,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 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 07:35:28,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:28,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:28,661 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 2 more)] === [2022-12-06 07:35:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1944078593, now seen corresponding path program 1 times [2022-12-06 07:35:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924600060] [2022-12-06 07:35:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924600060] [2022-12-06 07:35:30,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924600060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:30,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551946552] [2022-12-06 07:35:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:30,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:30,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:30,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:35:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:35:30,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:31,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:31,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:31,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 439 treesize of output 630 [2022-12-06 07:35:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:38,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551946552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:38,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:38,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 13 [2022-12-06 07:35:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699130934] [2022-12-06 07:35:38,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:35:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:35:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:35:38,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:38,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 934 flow. Second operand has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 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 07:35:38,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:38,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,563 INFO L130 PetriNetUnfolder]: 8442/12922 cut-off events. [2022-12-06 07:35:40,564 INFO L131 PetriNetUnfolder]: For 36474/36474 co-relation queries the response was YES. [2022-12-06 07:35:40,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46873 conditions, 12922 events. 8442/12922 cut-off events. For 36474/36474 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 77420 event pairs, 2276 based on Foata normal form. 6/12927 useless extension candidates. Maximal degree in co-relation 46709. Up to 4437 conditions per place. [2022-12-06 07:35:40,622 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 110 selfloop transitions, 59 changer transitions 68/237 dead transitions. [2022-12-06 07:35:40,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 237 transitions, 2122 flow [2022-12-06 07:35:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:35:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:35:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2022-12-06 07:35:40,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31794871794871793 [2022-12-06 07:35:40,629 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 934 flow. Second operand 15 states and 186 transitions. [2022-12-06 07:35:40,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 237 transitions, 2122 flow [2022-12-06 07:35:40,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 237 transitions, 1966 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-12-06 07:35:40,753 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 1267 flow [2022-12-06 07:35:40,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1267, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2022-12-06 07:35:40,754 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2022-12-06 07:35:40,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,754 INFO L89 Accepts]: Start accepts. Operand has 105 places, 108 transitions, 1267 flow [2022-12-06 07:35:40,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 108 transitions, 1267 flow [2022-12-06 07:35:40,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 1267 flow [2022-12-06 07:35:40,966 INFO L130 PetriNetUnfolder]: 300/1576 cut-off events. [2022-12-06 07:35:40,966 INFO L131 PetriNetUnfolder]: For 2352/2368 co-relation queries the response was YES. [2022-12-06 07:35:40,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 1576 events. 300/1576 cut-off events. For 2352/2368 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14664 event pairs, 187 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 3870. Up to 386 conditions per place. [2022-12-06 07:35:40,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 108 transitions, 1267 flow [2022-12-06 07:35:40,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-06 07:35:59,069 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:35:59,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18315 [2022-12-06 07:35:59,070 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 1314 flow [2022-12-06 07:35:59,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 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 07:35:59,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,070 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:59,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:35:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -515373277, now seen corresponding path program 1 times [2022-12-06 07:35:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593845698] [2022-12-06 07:35:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593845698] [2022-12-06 07:36:00,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593845698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238905213] [2022-12-06 07:36:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:00,294 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:00,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:36:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:36:00,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:36:00,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:36:02,710 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-06 07:36:02,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1138 treesize of output 1258 [2022-12-06 07:36:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:36:36,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238905213] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:36:36,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:36:36,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 07:36:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34583630] [2022-12-06 07:36:36,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:36:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:36:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:36:36,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:36:36,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 1314 flow. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 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 07:36:36,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:36:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,627 INFO L130 PetriNetUnfolder]: 8238/12656 cut-off events. [2022-12-06 07:36:38,627 INFO L131 PetriNetUnfolder]: For 41806/41806 co-relation queries the response was YES. [2022-12-06 07:36:38,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46161 conditions, 12656 events. 8238/12656 cut-off events. For 41806/41806 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 75836 event pairs, 2508 based on Foata normal form. 112/12768 useless extension candidates. Maximal degree in co-relation 43463. Up to 3738 conditions per place. [2022-12-06 07:36:38,689 INFO L137 encePairwiseOnDemand]: 23/44 looper letters, 134 selfloop transitions, 67 changer transitions 90/291 dead transitions. [2022-12-06 07:36:38,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 291 transitions, 2633 flow [2022-12-06 07:36:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:36:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:36:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 240 transitions. [2022-12-06 07:36:38,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 07:36:38,690 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 1314 flow. Second operand 18 states and 240 transitions. [2022-12-06 07:36:38,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 291 transitions, 2633 flow [2022-12-06 07:36:38,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 291 transitions, 2488 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,877 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 1438 flow [2022-12-06 07:36:38,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1438, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2022-12-06 07:36:38,878 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-06 07:36:38,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,878 INFO L89 Accepts]: Start accepts. Operand has 121 places, 115 transitions, 1438 flow [2022-12-06 07:36:38,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 115 transitions, 1438 flow [2022-12-06 07:36:38,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 115 transitions, 1438 flow [2022-12-06 07:36:39,016 INFO L130 PetriNetUnfolder]: 288/1545 cut-off events. [2022-12-06 07:36:39,016 INFO L131 PetriNetUnfolder]: For 2586/2602 co-relation queries the response was YES. [2022-12-06 07:36:39,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1545 events. 288/1545 cut-off events. For 2586/2602 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14472 event pairs, 187 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 3830. Up to 383 conditions per place. [2022-12-06 07:36:39,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 115 transitions, 1438 flow [2022-12-06 07:36:39,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 07:36:39,080 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,081 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,081 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,081 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,081 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,081 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,081 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,082 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,083 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:39,083 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,750 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,750 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,750 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,750 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:42,751 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:36:47,078 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:36:47,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8200 [2022-12-06 07:36:47,078 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 1442 flow [2022-12-06 07:36:47,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 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 07:36:47,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:36:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 07:36:47,288 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:36:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1794381854, now seen corresponding path program 1 times [2022-12-06 07:36:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216066330] [2022-12-06 07:36:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:36:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216066330] [2022-12-06 07:36:47,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216066330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:47,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286400211] [2022-12-06 07:36:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:47,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:47,992 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:47,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:36:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:36:48,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:36:48,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:36:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286400211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:36:48,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-12-06 07:36:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854619226] [2022-12-06 07:36:48,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:36:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:36:48,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:36:48,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:36:48,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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 07:36:48,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:36:48,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,786 INFO L130 PetriNetUnfolder]: 8952/13735 cut-off events. [2022-12-06 07:36:49,786 INFO L131 PetriNetUnfolder]: For 52072/52072 co-relation queries the response was YES. [2022-12-06 07:36:49,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50757 conditions, 13735 events. 8952/13735 cut-off events. For 52072/52072 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 84277 event pairs, 7556 based on Foata normal form. 144/13878 useless extension candidates. Maximal degree in co-relation 47976. Up to 11689 conditions per place. [2022-12-06 07:36:49,853 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 133 selfloop transitions, 9 changer transitions 4/146 dead transitions. [2022-12-06 07:36:49,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 146 transitions, 1959 flow [2022-12-06 07:36:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:36:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:36:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 07:36:49,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2022-12-06 07:36:49,856 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 1442 flow. Second operand 3 states and 73 transitions. [2022-12-06 07:36:49,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 146 transitions, 1959 flow [2022-12-06 07:36:50,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 146 transitions, 1773 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-12-06 07:36:50,092 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 1246 flow [2022-12-06 07:36:50,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2022-12-06 07:36:50,092 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-06 07:36:50,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,092 INFO L89 Accepts]: Start accepts. Operand has 108 places, 110 transitions, 1246 flow [2022-12-06 07:36:50,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 110 transitions, 1246 flow [2022-12-06 07:36:50,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 110 transitions, 1246 flow [2022-12-06 07:36:50,229 INFO L130 PetriNetUnfolder]: 290/1555 cut-off events. [2022-12-06 07:36:50,229 INFO L131 PetriNetUnfolder]: For 2206/2222 co-relation queries the response was YES. [2022-12-06 07:36:50,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4098 conditions, 1555 events. 290/1555 cut-off events. For 2206/2222 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14516 event pairs, 181 based on Foata normal form. 0/1525 useless extension candidates. Maximal degree in co-relation 3780. Up to 376 conditions per place. [2022-12-06 07:36:50,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 110 transitions, 1246 flow [2022-12-06 07:36:50,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-06 07:36:50,239 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:36:50,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 07:36:50,240 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 1246 flow [2022-12-06 07:36:50,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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 07:36:50,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:36:50,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:36:50,443 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:36:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash -682394318, now seen corresponding path program 1 times [2022-12-06 07:36:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711671684] [2022-12-06 07:36:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711671684] [2022-12-06 07:36:51,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711671684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:51,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915836649] [2022-12-06 07:36:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:51,978 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:51,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:36:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 07:36:52,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:52,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:36:52,491 INFO L321 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2022-12-06 07:36:52,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 104 [2022-12-06 07:36:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:36:52,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:36:54,322 INFO L321 Elim1Store]: treesize reduction 240, result has 70.0 percent of original size [2022-12-06 07:36:54,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1907 treesize of output 2258 Received shutdown request... [2022-12-06 07:47:10,652 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:47:10,658 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 07:47:10,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 07:47:10,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:10,668 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:47:10,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:47:10,860 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 31ms.. [2022-12-06 07:47:10,861 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 07:47:10,861 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 07:47:10,862 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 07:47:10,862 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 07:47:10,862 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:10,865 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:47:10,865 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:47:10,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:47:10 BasicIcfg [2022-12-06 07:47:10,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:47:10,875 INFO L158 Benchmark]: Toolchain (without parser) took 809132.04ms. Allocated memory was 180.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 145.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 07:47:10,875 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory was 158.3MB in the beginning and 158.2MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:47:10,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.74ms. Allocated memory is still 180.4MB. Free memory was 145.3MB in the beginning and 128.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 07:47:10,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.72ms. Allocated memory is still 180.4MB. Free memory was 128.5MB in the beginning and 125.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:47:10,876 INFO L158 Benchmark]: Boogie Preprocessor took 73.31ms. Allocated memory is still 180.4MB. Free memory was 125.4MB in the beginning and 122.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:47:10,876 INFO L158 Benchmark]: RCFGBuilder took 1017.24ms. Allocated memory is still 180.4MB. Free memory was 122.8MB in the beginning and 155.0MB in the end (delta: -32.3MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. [2022-12-06 07:47:10,876 INFO L158 Benchmark]: TraceAbstraction took 807607.55ms. Allocated memory was 180.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 154.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 07:47:10,880 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.11ms. Allocated memory is still 180.4MB. Free memory was 158.3MB in the beginning and 158.2MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 355.74ms. Allocated memory is still 180.4MB. Free memory was 145.3MB in the beginning and 128.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.72ms. Allocated memory is still 180.4MB. Free memory was 128.5MB in the beginning and 125.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.31ms. Allocated memory is still 180.4MB. Free memory was 125.4MB in the beginning and 122.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1017.24ms. Allocated memory is still 180.4MB. Free memory was 122.8MB in the beginning and 155.0MB in the end (delta: -32.3MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. * TraceAbstraction took 807607.55ms. Allocated memory was 180.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 154.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.3s, 291 PlacesBefore, 38 PlacesAfterwards, 315 TransitionsBefore, 33 TransitionsAfterwards, 5184 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 196 TrivialYvCompositions, 57 ConcurrentYvCompositions, 21 ChoiceCompositions, 274 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 3610, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 4536, Positive cache size: 4536, Positive conditional cache size: 0, Positive unconditional cache size: 4536, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 5.8s, 39 PlacesBefore, 39 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 42 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 39 PlacesBefore, 39 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 41 PlacesBefore, 41 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.7s, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 30.4s, 74 PlacesBefore, 72 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 12.3s, 87 PlacesBefore, 87 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 90 PlacesBefore, 90 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 103 PlacesBefore, 103 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 94 PlacesBefore, 94 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 18.1s, 105 PlacesBefore, 105 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 8.1s, 119 PlacesBefore, 118 PlacesAfterwards, 115 TransitionsBefore, 114 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 107 PlacesBefore, 107 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 206]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 31ms.. - TimeoutResultAtElement [Line: 196]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 31ms.. - TimeoutResultAtElement [Line: 197]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 31ms.. - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 31ms.. - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 31ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 347 locations, 5 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: 807.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.6s, HoareTripleCheckerStatistics: 91 mSolverCounterUnknown, 2583 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2583 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3386 IncrementalHoareTripleChecker+Invalid, 3745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 0 mSDtfsCounter, 3386 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 360 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1442occurred in iteration=15, InterpolantAutomatonStates: 125, 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.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 68.8s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 799 ConstructedInterpolants, 22 QuantifiedInterpolants, 14601 SizeOfPredicates, 379 NumberOfNonLiveVariables, 3537 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 43/81 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 could not prove your program: Timeout Completed graceful shutdown