/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:22:19,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:22:19,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:22:19,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:22:19,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:22:19,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:22:19,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:22:19,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:22:19,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:22:19,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:22:19,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:22:19,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:22:19,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:22:19,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:22:19,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:22:19,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:22:19,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:22:19,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:22:19,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:22:19,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:22:19,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:22:19,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:22:19,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:22:19,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:22:19,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:22:19,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:22:19,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:22:19,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:22:19,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:22:19,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:22:19,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:22:19,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:22:19,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:22:19,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:22:19,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:22:19,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:22:19,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:22:19,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:22:19,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:22:19,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:22:19,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:22:19,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:22:20,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:22:20,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:22:20,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:22:20,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:22:20,002 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:22:20,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:22:20,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:22:20,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:22:20,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:22:20,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:22:20,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:22:20,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:22:20,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:22:20,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:22:20,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:22:20,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:22:20,006 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 05:22:20,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:22:20,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:22:20,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:22:20,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:22:20,277 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:22:20,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 05:22:21,289 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:22:21,543 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:22:21,544 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 05:22:21,569 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087e2a867/19973070d054499fb51863e79d8decf5/FLAG79bb8c6c8 [2022-12-06 05:22:21,578 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087e2a867/19973070d054499fb51863e79d8decf5 [2022-12-06 05:22:21,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:22:21,581 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:22:21,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:22:21,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:22:21,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:22:21,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56877629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21, skipping insertion in model container [2022-12-06 05:22:21,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:22:21,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:22:21,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,732 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-1.wvr-bad.c[5161,5174] [2022-12-06 05:22:21,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:22:21,747 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:22:21,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:21,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:21,773 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-1.wvr-bad.c[5161,5174] [2022-12-06 05:22:21,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:22:21,790 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:22:21,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21 WrapperNode [2022-12-06 05:22:21,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:22:21,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:22:21,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:22:21,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:22:21,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,845 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2022-12-06 05:22:21,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:22:21,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:22:21,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:22:21,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:22:21,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,891 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:22:21,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:22:21,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:22:21,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:22:21,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (1/1) ... [2022-12-06 05:22:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:22:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:21,936 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 05:22:21,964 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 05:22:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:22:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:22:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:22:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:22:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:22:21,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:22:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:22:21,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:22:21,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:22:21,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:22:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:22:21,980 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 05:22:22,109 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:22:22,110 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:22:22,426 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:22:22,657 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:22:22,658 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:22:22,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:22:22 BoogieIcfgContainer [2022-12-06 05:22:22,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:22:22,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:22:22,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:22:22,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:22:22,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:22:21" (1/3) ... [2022-12-06 05:22:22,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ca2df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:22:22, skipping insertion in model container [2022-12-06 05:22:22,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:21" (2/3) ... [2022-12-06 05:22:22,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ca2df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:22:22, skipping insertion in model container [2022-12-06 05:22:22,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:22:22" (3/3) ... [2022-12-06 05:22:22,665 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2022-12-06 05:22:22,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:22:22,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:22:22,679 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:22:22,761 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:22:22,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 05:22:22,945 INFO L130 PetriNetUnfolder]: 27/250 cut-off events. [2022-12-06 05:22:22,945 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:22:22,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 27/250 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 05:22:22,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 05:22:22,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 240 transitions, 498 flow [2022-12-06 05:22:22,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:22,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 05:22:22,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 240 transitions, 498 flow [2022-12-06 05:22:23,016 INFO L130 PetriNetUnfolder]: 27/240 cut-off events. [2022-12-06 05:22:23,017 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:22:23,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 240 events. 27/240 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 05:22:23,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 05:22:23,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-06 05:22:31,859 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 05:22:31,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:22:31,881 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;@49916daf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:22:31,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:22:31,886 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2022-12-06 05:22:31,886 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:22:31,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:31,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:31,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1929606784, now seen corresponding path program 1 times [2022-12-06 05:22:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:31,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896175189] [2022-12-06 05:22:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:32,334 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 05:22:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:32,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896175189] [2022-12-06 05:22:32,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896175189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:32,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:32,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:22:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373432135] [2022-12-06 05:22:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:32,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:22:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:22:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:22:32,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:22:32,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 05:22:32,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:32,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:22:32,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:32,482 INFO L130 PetriNetUnfolder]: 164/251 cut-off events. [2022-12-06 05:22:32,482 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 05:22:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 251 events. 164/251 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 37 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2022-12-06 05:22:32,484 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 36 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2022-12-06 05:22:32,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 197 flow [2022-12-06 05:22:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 05:22:32,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 05:22:32,494 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 3 states and 42 transitions. [2022-12-06 05:22:32,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 197 flow [2022-12-06 05:22:32,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:22:32,501 INFO L231 Difference]: Finished difference. Result has 26 places, 28 transitions, 82 flow [2022-12-06 05:22:32,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=28} [2022-12-06 05:22:32,509 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-06 05:22:32,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:32,510 INFO L89 Accepts]: Start accepts. Operand has 26 places, 28 transitions, 82 flow [2022-12-06 05:22:32,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:32,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:32,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 28 transitions, 82 flow [2022-12-06 05:22:32,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 28 transitions, 82 flow [2022-12-06 05:22:32,520 INFO L130 PetriNetUnfolder]: 14/44 cut-off events. [2022-12-06 05:22:32,521 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:22:32,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 44 events. 14/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 33. Up to 14 conditions per place. [2022-12-06 05:22:32,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 28 transitions, 82 flow [2022-12-06 05:22:32,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 05:22:32,522 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:32,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:22:32,523 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 28 transitions, 82 flow [2022-12-06 05:22:32,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 05:22:32,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:32,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:32,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:22:32,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash 495866599, now seen corresponding path program 1 times [2022-12-06 05:22:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:32,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227640977] [2022-12-06 05:22:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:32,684 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 05:22:32,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:32,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227640977] [2022-12-06 05:22:32,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227640977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:32,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:32,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975221999] [2022-12-06 05:22:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:32,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:32,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:32,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:32,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:32,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:22:32,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:32,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:32,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:22:32,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:32,816 INFO L130 PetriNetUnfolder]: 299/473 cut-off events. [2022-12-06 05:22:32,816 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-06 05:22:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 473 events. 299/473 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1380 event pairs, 174 based on Foata normal form. 28/495 useless extension candidates. Maximal degree in co-relation 350. Up to 252 conditions per place. [2022-12-06 05:22:32,818 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-06 05:22:32,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 53 transitions, 256 flow [2022-12-06 05:22:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 05:22:32,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49 [2022-12-06 05:22:32,820 INFO L175 Difference]: Start difference. First operand has 26 places, 28 transitions, 82 flow. Second operand 4 states and 49 transitions. [2022-12-06 05:22:32,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 53 transitions, 256 flow [2022-12-06 05:22:32,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:32,821 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 100 flow [2022-12-06 05:22:32,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2022-12-06 05:22:32,822 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 05:22:32,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:32,822 INFO L89 Accepts]: Start accepts. Operand has 30 places, 30 transitions, 100 flow [2022-12-06 05:22:32,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:32,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:32,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 30 transitions, 100 flow [2022-12-06 05:22:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 30 transitions, 100 flow [2022-12-06 05:22:32,853 INFO L130 PetriNetUnfolder]: 21/79 cut-off events. [2022-12-06 05:22:32,853 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:22:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 79 events. 21/79 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 65. Up to 21 conditions per place. [2022-12-06 05:22:32,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 30 transitions, 100 flow [2022-12-06 05:22:32,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 05:22:36,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:36,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3653 [2022-12-06 05:22:36,475 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 106 flow [2022-12-06 05:22:36,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:36,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:36,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:36,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:22:36,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash 241586444, now seen corresponding path program 1 times [2022-12-06 05:22:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:36,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980074391] [2022-12-06 05:22:36,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:36,702 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 05:22:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980074391] [2022-12-06 05:22:36,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980074391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:36,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:36,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:22:36,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170297720] [2022-12-06 05:22:36,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:36,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:22:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:22:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:22:36,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:22:36,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 05:22:36,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:36,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:22:36,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:36,794 INFO L130 PetriNetUnfolder]: 263/429 cut-off events. [2022-12-06 05:22:36,795 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 05:22:36,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 429 events. 263/429 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1378 event pairs, 74 based on Foata normal form. 28/451 useless extension candidates. Maximal degree in co-relation 570. Up to 261 conditions per place. [2022-12-06 05:22:36,797 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 4 changer transitions 2/40 dead transitions. [2022-12-06 05:22:36,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 208 flow [2022-12-06 05:22:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 05:22:36,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2022-12-06 05:22:36,799 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 106 flow. Second operand 3 states and 41 transitions. [2022-12-06 05:22:36,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 208 flow [2022-12-06 05:22:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 200 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:36,802 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 96 flow [2022-12-06 05:22:36,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2022-12-06 05:22:36,803 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-06 05:22:36,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:36,803 INFO L89 Accepts]: Start accepts. Operand has 31 places, 28 transitions, 96 flow [2022-12-06 05:22:36,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:36,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:36,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 28 transitions, 96 flow [2022-12-06 05:22:36,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 96 flow [2022-12-06 05:22:36,811 INFO L130 PetriNetUnfolder]: 14/63 cut-off events. [2022-12-06 05:22:36,812 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:22:36,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 63 events. 14/63 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 50. Up to 14 conditions per place. [2022-12-06 05:22:36,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 96 flow [2022-12-06 05:22:36,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 05:22:36,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:36,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:22:36,817 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 96 flow [2022-12-06 05:22:36,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 05:22:36,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:36,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:36,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:22:36,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash 21755367, now seen corresponding path program 1 times [2022-12-06 05:22:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:36,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730864619] [2022-12-06 05:22:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:36,990 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 05:22:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:36,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730864619] [2022-12-06 05:22:36,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730864619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:36,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:36,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:36,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285836205] [2022-12-06 05:22:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:36,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:36,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:36,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:36,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:36,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:22:36,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 05:22:36,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:36,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:22:36,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:37,101 INFO L130 PetriNetUnfolder]: 261/440 cut-off events. [2022-12-06 05:22:37,101 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-12-06 05:22:37,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 440 events. 261/440 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1365 event pairs, 114 based on Foata normal form. 44/479 useless extension candidates. Maximal degree in co-relation 892. Up to 252 conditions per place. [2022-12-06 05:22:37,103 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 48 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2022-12-06 05:22:37,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 268 flow [2022-12-06 05:22:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 05:22:37,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:22:37,104 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 96 flow. Second operand 4 states and 52 transitions. [2022-12-06 05:22:37,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 268 flow [2022-12-06 05:22:37,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 252 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:37,105 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 96 flow [2022-12-06 05:22:37,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 05:22:37,106 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 05:22:37,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:37,106 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 96 flow [2022-12-06 05:22:37,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:37,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:37,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 96 flow [2022-12-06 05:22:37,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 96 flow [2022-12-06 05:22:37,112 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-06 05:22:37,112 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:22:37,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 45 events. 9/45 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 49. Up to 13 conditions per place. [2022-12-06 05:22:37,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 96 flow [2022-12-06 05:22:37,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 05:22:37,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:37,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:22:37,120 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 96 flow [2022-12-06 05:22:37,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 05:22:37,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:37,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:37,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:22:37,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1267645155, now seen corresponding path program 1 times [2022-12-06 05:22:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063608656] [2022-12-06 05:22:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:37,293 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 05:22:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:37,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063608656] [2022-12-06 05:22:37,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063608656] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:37,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790888219] [2022-12-06 05:22:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:37,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:37,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:37,307 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 05:22:37,392 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 05:22:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:37,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:22:37,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:37,551 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 05:22:37,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:37,686 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 05:22:37,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790888219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:37,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:37,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 05:22:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394078994] [2022-12-06 05:22:37,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:37,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:22:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:37,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:22:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:22:37,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:22:37,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 96 flow. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 05:22:37,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:37,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:22:37,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:37,799 INFO L130 PetriNetUnfolder]: 270/434 cut-off events. [2022-12-06 05:22:37,799 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2022-12-06 05:22:37,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 434 events. 270/434 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1354 event pairs, 53 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 542. Up to 281 conditions per place. [2022-12-06 05:22:37,801 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 41 selfloop transitions, 4 changer transitions 3/48 dead transitions. [2022-12-06 05:22:37,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 246 flow [2022-12-06 05:22:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 05:22:37,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 05:22:37,802 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 96 flow. Second operand 4 states and 47 transitions. [2022-12-06 05:22:37,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 246 flow [2022-12-06 05:22:37,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:37,803 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 121 flow [2022-12-06 05:22:37,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 05:22:37,804 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-06 05:22:37,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:37,804 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 121 flow [2022-12-06 05:22:37,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:37,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:37,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 121 flow [2022-12-06 05:22:37,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 121 flow [2022-12-06 05:22:37,811 INFO L130 PetriNetUnfolder]: 10/49 cut-off events. [2022-12-06 05:22:37,812 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:22:37,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 49 events. 10/49 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 47. Up to 15 conditions per place. [2022-12-06 05:22:37,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 121 flow [2022-12-06 05:22:37,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 05:22:37,814 WARN L322 ript$VariableManager]: TermVariable LBE552 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:37,814 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:37,814 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:37,814 WARN L322 ript$VariableManager]: TermVariable LBE617 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:37,814 WARN L322 ript$VariableManager]: TermVariable LBE604 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:37,814 WARN L322 ript$VariableManager]: TermVariable LBE218 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:38,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:38,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 639 [2022-12-06 05:22:38,444 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 122 flow [2022-12-06 05:22:38,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 05:22:38,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:38,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:38,462 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 05:22:38,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:38,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1139043018, now seen corresponding path program 1 times [2022-12-06 05:22:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:38,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722785581] [2022-12-06 05:22:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:38,959 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 05:22:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:38,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722785581] [2022-12-06 05:22:38,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722785581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:38,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:38,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:38,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776136167] [2022-12-06 05:22:38,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:38,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:38,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:38,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:22:38,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:38,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:38,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:22:38,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:39,085 INFO L130 PetriNetUnfolder]: 323/532 cut-off events. [2022-12-06 05:22:39,085 INFO L131 PetriNetUnfolder]: For 411/411 co-relation queries the response was YES. [2022-12-06 05:22:39,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 532 events. 323/532 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1813 event pairs, 158 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 817. Up to 449 conditions per place. [2022-12-06 05:22:39,087 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 40 selfloop transitions, 4 changer transitions 7/51 dead transitions. [2022-12-06 05:22:39,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 277 flow [2022-12-06 05:22:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:22:39,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 05:22:39,090 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 122 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:22:39,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 277 flow [2022-12-06 05:22:39,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 266 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:39,092 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 143 flow [2022-12-06 05:22:39,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-06 05:22:39,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 05:22:39,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:39,094 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 143 flow [2022-12-06 05:22:39,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:39,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:39,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 143 flow [2022-12-06 05:22:39,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 143 flow [2022-12-06 05:22:39,106 INFO L130 PetriNetUnfolder]: 13/70 cut-off events. [2022-12-06 05:22:39,106 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 05:22:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 70 events. 13/70 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2022-12-06 05:22:39,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 143 flow [2022-12-06 05:22:39,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 05:22:43,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:43,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3995 [2022-12-06 05:22:43,089 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 153 flow [2022-12-06 05:22:43,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:43,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:43,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:43,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:22:43,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1666267141, now seen corresponding path program 1 times [2022-12-06 05:22:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:43,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207055932] [2022-12-06 05:22:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:43,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 05:22:43,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:43,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207055932] [2022-12-06 05:22:43,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207055932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277017652] [2022-12-06 05:22:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:43,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:43,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:43,708 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 05:22:43,711 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 05:22:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:43,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:22:43,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:43,923 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 05:22:43,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:44,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:22:44,402 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 379 treesize of output 491 [2022-12-06 05:22:46,987 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 05:22:46,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277017652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:46,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:46,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:22:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444992511] [2022-12-06 05:22:46,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:46,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:22:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:46,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:22:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:22:46,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:22:46,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 153 flow. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 05:22:46,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:46,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:22:46,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:47,516 INFO L130 PetriNetUnfolder]: 537/862 cut-off events. [2022-12-06 05:22:47,516 INFO L131 PetriNetUnfolder]: For 680/680 co-relation queries the response was YES. [2022-12-06 05:22:47,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 862 events. 537/862 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3317 event pairs, 96 based on Foata normal form. 3/859 useless extension candidates. Maximal degree in co-relation 1167. Up to 367 conditions per place. [2022-12-06 05:22:47,520 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 73 selfloop transitions, 17 changer transitions 25/115 dead transitions. [2022-12-06 05:22:47,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 115 transitions, 613 flow [2022-12-06 05:22:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:22:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:22:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2022-12-06 05:22:47,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-06 05:22:47,521 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 153 flow. Second operand 10 states and 116 transitions. [2022-12-06 05:22:47,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 115 transitions, 613 flow [2022-12-06 05:22:47,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 115 transitions, 604 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:47,524 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 256 flow [2022-12-06 05:22:47,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-06 05:22:47,525 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 05:22:47,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:47,525 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 256 flow [2022-12-06 05:22:47,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:47,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:47,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 256 flow [2022-12-06 05:22:47,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 256 flow [2022-12-06 05:22:47,540 INFO L130 PetriNetUnfolder]: 19/99 cut-off events. [2022-12-06 05:22:47,540 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 05:22:47,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 99 events. 19/99 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 321 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 166. Up to 24 conditions per place. [2022-12-06 05:22:47,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 256 flow [2022-12-06 05:22:47,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 05:22:47,544 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,544 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:47,545 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,921 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,922 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:48,923 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,541 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:50,542 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,840 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,841 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,842 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:54,501 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:22:54,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6976 [2022-12-06 05:22:54,501 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 273 flow [2022-12-06 05:22:54,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 05:22:54,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:54,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:54,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 05:22:54,702 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 05:22:54,702 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1520627378, now seen corresponding path program 1 times [2022-12-06 05:22:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:54,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754736714] [2022-12-06 05:22:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:54,892 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 05:22:54,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:54,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754736714] [2022-12-06 05:22:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754736714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:54,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:54,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802091466] [2022-12-06 05:22:54,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:54,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:54,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:54,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:22:54,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:54,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:54,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:22:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:55,052 INFO L130 PetriNetUnfolder]: 475/769 cut-off events. [2022-12-06 05:22:55,052 INFO L131 PetriNetUnfolder]: For 1348/1348 co-relation queries the response was YES. [2022-12-06 05:22:55,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 769 events. 475/769 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2903 event pairs, 160 based on Foata normal form. 14/771 useless extension candidates. Maximal degree in co-relation 2024. Up to 602 conditions per place. [2022-12-06 05:22:55,064 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 4 changer transitions 7/49 dead transitions. [2022-12-06 05:22:55,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 374 flow [2022-12-06 05:22:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 05:22:55,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:22:55,065 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 273 flow. Second operand 3 states and 40 transitions. [2022-12-06 05:22:55,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 374 flow [2022-12-06 05:22:55,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 312 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-06 05:22:55,069 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 201 flow [2022-12-06 05:22:55,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2022-12-06 05:22:55,071 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 05:22:55,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:55,071 INFO L89 Accepts]: Start accepts. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 05:22:55,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:55,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:55,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 05:22:55,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 05:22:55,086 INFO L130 PetriNetUnfolder]: 17/93 cut-off events. [2022-12-06 05:22:55,086 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 05:22:55,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 93 events. 17/93 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 307 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 14 conditions per place. [2022-12-06 05:22:55,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 05:22:55,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 05:22:55,087 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:55,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:22:55,090 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 201 flow [2022-12-06 05:22:55,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:55,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:55,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:55,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:22:55,090 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2132231823, now seen corresponding path program 1 times [2022-12-06 05:22:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500354235] [2022-12-06 05:22:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:55,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500354235] [2022-12-06 05:22:55,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500354235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:55,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036364084] [2022-12-06 05:22:55,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:55,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:55,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:55,765 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 05:22:55,783 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 05:22:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:55,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:22:55,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:55,957 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 05:22:55,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:22:55,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036364084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:55,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:22:55,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 05:22:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884505932] [2022-12-06 05:22:55,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:55,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:22:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:55,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:22:55,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:22:55,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:22:55,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:55,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:55,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:22:55,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:56,161 INFO L130 PetriNetUnfolder]: 647/1087 cut-off events. [2022-12-06 05:22:56,162 INFO L131 PetriNetUnfolder]: For 1012/1012 co-relation queries the response was YES. [2022-12-06 05:22:56,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1087 events. 647/1087 cut-off events. For 1012/1012 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4649 event pairs, 324 based on Foata normal form. 24/1101 useless extension candidates. Maximal degree in co-relation 2716. Up to 480 conditions per place. [2022-12-06 05:22:56,165 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 44 selfloop transitions, 15 changer transitions 12/71 dead transitions. [2022-12-06 05:22:56,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 440 flow [2022-12-06 05:22:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:22:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:22:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 05:22:56,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 05:22:56,166 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 201 flow. Second operand 6 states and 63 transitions. [2022-12-06 05:22:56,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 440 flow [2022-12-06 05:22:56,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:56,170 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 266 flow [2022-12-06 05:22:56,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2022-12-06 05:22:56,170 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 05:22:56,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:56,171 INFO L89 Accepts]: Start accepts. Operand has 46 places, 46 transitions, 266 flow [2022-12-06 05:22:56,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:56,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:56,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 46 transitions, 266 flow [2022-12-06 05:22:56,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 266 flow [2022-12-06 05:22:56,188 INFO L130 PetriNetUnfolder]: 21/137 cut-off events. [2022-12-06 05:22:56,188 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 05:22:56,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 137 events. 21/137 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 235. Up to 14 conditions per place. [2022-12-06 05:22:56,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 266 flow [2022-12-06 05:22:56,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 05:22:56,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:56,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:22:56,191 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 266 flow [2022-12-06 05:22:56,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:56,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:56,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:56,195 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 05:22:56,395 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 05:22:56,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1442573577, now seen corresponding path program 1 times [2022-12-06 05:22:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:56,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20477054] [2022-12-06 05:22:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:57,014 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 05:22:57,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:57,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20477054] [2022-12-06 05:22:57,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20477054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:57,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467965368] [2022-12-06 05:22:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:57,016 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 05:22:57,040 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 05:22:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:57,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:22:57,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:57,285 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 05:22:57,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:59,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:22:59,539 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 435 treesize of output 639 [2022-12-06 05:23:01,709 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 05:23:01,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467965368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:01,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:01,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:23:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360416640] [2022-12-06 05:23:01,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:01,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:23:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:01,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:23:01,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:23:01,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:23:01,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 266 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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 05:23:01,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:01,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:23:01,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:02,650 INFO L130 PetriNetUnfolder]: 1168/1986 cut-off events. [2022-12-06 05:23:02,650 INFO L131 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2022-12-06 05:23:02,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 1986 events. 1168/1986 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10349 event pairs, 330 based on Foata normal form. 16/1998 useless extension candidates. Maximal degree in co-relation 5125. Up to 337 conditions per place. [2022-12-06 05:23:02,657 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 97 selfloop transitions, 34 changer transitions 46/177 dead transitions. [2022-12-06 05:23:02,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 177 transitions, 1087 flow [2022-12-06 05:23:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:23:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:23:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-12-06 05:23:02,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41644562334217505 [2022-12-06 05:23:02,658 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 266 flow. Second operand 13 states and 157 transitions. [2022-12-06 05:23:02,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 177 transitions, 1087 flow [2022-12-06 05:23:02,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 177 transitions, 1065 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:23:02,666 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 489 flow [2022-12-06 05:23:02,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=489, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-06 05:23:02,667 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2022-12-06 05:23:02,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:02,667 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 489 flow [2022-12-06 05:23:02,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:02,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:02,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 489 flow [2022-12-06 05:23:02,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 489 flow [2022-12-06 05:23:02,700 INFO L130 PetriNetUnfolder]: 32/240 cut-off events. [2022-12-06 05:23:02,700 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-06 05:23:02,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 240 events. 32/240 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1398 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 455. Up to 25 conditions per place. [2022-12-06 05:23:02,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 489 flow [2022-12-06 05:23:02,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 05:23:09,070 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:23:09,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6404 [2022-12-06 05:23:09,071 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 501 flow [2022-12-06 05:23:09,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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 05:23:09,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:09,072 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:09,076 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 05:23:09,276 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 05:23:09,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:23:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1295621344, now seen corresponding path program 1 times [2022-12-06 05:23:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:09,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656212996] [2022-12-06 05:23:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:09,475 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 05:23:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656212996] [2022-12-06 05:23:09,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656212996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147055547] [2022-12-06 05:23:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:09,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:09,476 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 05:23:09,478 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 05:23:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:09,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:23:09,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:09,883 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 05:23:09,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:10,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:10,621 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 557 treesize of output 648 [2022-12-06 05:23:11,592 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 05:23:11,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147055547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:11,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:11,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:23:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530015112] [2022-12-06 05:23:11,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:11,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:23:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:23:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:23:11,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:23:11,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 501 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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 05:23:11,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:11,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:23:11,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:12,482 INFO L130 PetriNetUnfolder]: 1235/2142 cut-off events. [2022-12-06 05:23:12,483 INFO L131 PetriNetUnfolder]: For 3467/3467 co-relation queries the response was YES. [2022-12-06 05:23:12,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 2142 events. 1235/2142 cut-off events. For 3467/3467 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11550 event pairs, 316 based on Foata normal form. 98/2235 useless extension candidates. Maximal degree in co-relation 5600. Up to 392 conditions per place. [2022-12-06 05:23:12,489 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 80 selfloop transitions, 30 changer transitions 32/142 dead transitions. [2022-12-06 05:23:12,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1018 flow [2022-12-06 05:23:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:23:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:23:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2022-12-06 05:23:12,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2022-12-06 05:23:12,490 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 501 flow. Second operand 11 states and 122 transitions. [2022-12-06 05:23:12,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1018 flow [2022-12-06 05:23:12,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 142 transitions, 991 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:23:12,498 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 559 flow [2022-12-06 05:23:12,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=559, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2022-12-06 05:23:12,500 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2022-12-06 05:23:12,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:12,500 INFO L89 Accepts]: Start accepts. Operand has 71 places, 63 transitions, 559 flow [2022-12-06 05:23:12,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:12,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:12,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 63 transitions, 559 flow [2022-12-06 05:23:12,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 63 transitions, 559 flow [2022-12-06 05:23:12,525 INFO L130 PetriNetUnfolder]: 30/261 cut-off events. [2022-12-06 05:23:12,526 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-06 05:23:12,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 261 events. 30/261 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 517. Up to 27 conditions per place. [2022-12-06 05:23:12,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 63 transitions, 559 flow [2022-12-06 05:23:12,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 05:23:23,710 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:23:23,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11211 [2022-12-06 05:23:23,711 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 585 flow [2022-12-06 05:23:23,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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 05:23:23,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:23,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:23,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:23:23,917 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,SelfDestructingSolverStorable10 [2022-12-06 05:23:23,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:23:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1434548131, now seen corresponding path program 1 times [2022-12-06 05:23:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:23,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001312565] [2022-12-06 05:23:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:24,141 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 05:23:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001312565] [2022-12-06 05:23:24,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001312565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154189311] [2022-12-06 05:23:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:24,143 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 05:23:24,145 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 05:23:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:24,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:23:24,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:24,295 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 05:23:24,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:23:24,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154189311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:24,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:23:24,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-12-06 05:23:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169361694] [2022-12-06 05:23:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:24,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:23:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:23:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:23:24,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:23:24,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 05:23:24,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:24,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:23:24,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:24,601 INFO L130 PetriNetUnfolder]: 1261/2195 cut-off events. [2022-12-06 05:23:24,601 INFO L131 PetriNetUnfolder]: For 4415/4415 co-relation queries the response was YES. [2022-12-06 05:23:24,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6684 conditions, 2195 events. 1261/2195 cut-off events. For 4415/4415 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11904 event pairs, 1044 based on Foata normal form. 12/2202 useless extension candidates. Maximal degree in co-relation 5929. Up to 1977 conditions per place. [2022-12-06 05:23:24,608 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 54 selfloop transitions, 5 changer transitions 19/78 dead transitions. [2022-12-06 05:23:24,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 783 flow [2022-12-06 05:23:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:23:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:23:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 05:23:24,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:23:24,609 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 585 flow. Second operand 3 states and 51 transitions. [2022-12-06 05:23:24,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 783 flow [2022-12-06 05:23:24,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 721 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 05:23:24,617 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 498 flow [2022-12-06 05:23:24,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2022-12-06 05:23:24,618 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2022-12-06 05:23:24,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:24,618 INFO L89 Accepts]: Start accepts. Operand has 67 places, 59 transitions, 498 flow [2022-12-06 05:23:24,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:24,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:24,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 59 transitions, 498 flow [2022-12-06 05:23:24,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 498 flow [2022-12-06 05:23:24,642 INFO L130 PetriNetUnfolder]: 29/236 cut-off events. [2022-12-06 05:23:24,642 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-06 05:23:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 236 events. 29/236 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1387 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 502. Up to 26 conditions per place. [2022-12-06 05:23:24,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 498 flow [2022-12-06 05:23:24,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 05:23:24,644 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:23:24,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:23:24,645 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 498 flow [2022-12-06 05:23:24,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 05:23:24,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:24,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:24,654 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 05:23:24,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:24,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:23:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 888802008, now seen corresponding path program 1 times [2022-12-06 05:23:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:24,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414993021] [2022-12-06 05:23:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:25,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414993021] [2022-12-06 05:23:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414993021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107970746] [2022-12-06 05:23:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:25,076 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 05:23:25,080 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 05:23:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:25,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:23:25,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:25,350 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 05:23:25,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:25,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:25,614 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 589 treesize of output 624 [2022-12-06 05:23:26,270 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 05:23:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107970746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:26,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-06 05:23:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598508332] [2022-12-06 05:23:26,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:26,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:23:26,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:26,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:23:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:23:26,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:23:26,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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 05:23:26,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:26,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:23:26,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:26,593 INFO L130 PetriNetUnfolder]: 1102/1934 cut-off events. [2022-12-06 05:23:26,593 INFO L131 PetriNetUnfolder]: For 3831/3831 co-relation queries the response was YES. [2022-12-06 05:23:26,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 1934 events. 1102/1934 cut-off events. For 3831/3831 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10244 event pairs, 491 based on Foata normal form. 48/1977 useless extension candidates. Maximal degree in co-relation 5573. Up to 605 conditions per place. [2022-12-06 05:23:26,599 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 52 selfloop transitions, 11 changer transitions 37/100 dead transitions. [2022-12-06 05:23:26,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 764 flow [2022-12-06 05:23:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:23:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:23:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 05:23:26,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2022-12-06 05:23:26,600 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 498 flow. Second operand 6 states and 81 transitions. [2022-12-06 05:23:26,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 764 flow [2022-12-06 05:23:26,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 727 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 05:23:26,606 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 335 flow [2022-12-06 05:23:26,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2022-12-06 05:23:26,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 05:23:26,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:26,607 INFO L89 Accepts]: Start accepts. Operand has 63 places, 47 transitions, 335 flow [2022-12-06 05:23:26,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:26,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:26,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 47 transitions, 335 flow [2022-12-06 05:23:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 335 flow [2022-12-06 05:23:26,625 INFO L130 PetriNetUnfolder]: 22/147 cut-off events. [2022-12-06 05:23:26,626 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 05:23:26,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 147 events. 22/147 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 643 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 298. Up to 23 conditions per place. [2022-12-06 05:23:26,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 335 flow [2022-12-06 05:23:26,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 05:23:31,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:31,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4669 [2022-12-06 05:23:31,277 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 336 flow [2022-12-06 05:23:31,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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 05:23:31,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:31,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:31,284 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 05:23:31,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:31,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:23:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash -366559004, now seen corresponding path program 1 times [2022-12-06 05:23:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:31,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658511612] [2022-12-06 05:23:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:32,450 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 05:23:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658511612] [2022-12-06 05:23:32,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658511612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51119495] [2022-12-06 05:23:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:32,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:32,453 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 05:23:32,454 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 05:23:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:32,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 05:23:32,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:32,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-12-06 05:23:32,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:23:32,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 05:23:32,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-12-06 05:23:32,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 05:23:32,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 05:23:32,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 05:23:32,930 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 05:23:32,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:39,899 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 05:23:39,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51119495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:39,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:39,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-06 05:23:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484212229] [2022-12-06 05:23:39,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:23:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:23:39,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=230, Unknown=6, NotChecked=0, Total=306 [2022-12-06 05:23:39,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:23:39,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 336 flow. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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 05:23:39,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:39,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:23:39,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:39,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse52 (* c_~node_back~0 4)) (.cse51 (* c_~node_front~0 4))) (let ((.cse2 (= c_~node_state~0 0)) (.cse58 (+ .cse51 c_~node~0.offset)) (.cse60 (select |c_#memory_int| c_~node~0.base)) (.cse16 (+ .cse52 c_~node~0.offset))) (let ((.cse1 (= c_~node_state~0 1)) (.cse54 (= c_~manager_state~0 1)) (.cse53 (= c_~manager_state~0 0)) (.cse28 (<= c_~node_size~0 c_~node_front~0)) (.cse30 (<= c_~node_back~0 c_~node_front~0)) (.cse56 (= 2 c_~manager_state~0)) (.cse55 (= 3 c_~manager_state~0)) (.cse32 (select .cse60 .cse16)) (.cse29 (select .cse60 .cse58)) (.cse26 (not .cse2)) (.cse27 (< c_~node_front~0 0)) (.cse49 (<= (+ c_~node_back~0 1) c_~node_front~0))) (let ((.cse3 (not (= (mod (* c_~safe~0 255) 256) 0))) (.cse7 (select |c_#memory_int| c_~client~0.base)) (.cse17 (or .cse26 .cse27 .cse49 (forall ((v_ArrVal_705 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse59 .cse58) (select .cse59 .cse16)))))) (.cse25 (or .cse26 .cse27 .cse49 (= .cse32 .cse29))) (.cse5 (select |c_#memory_int| c_~manager~0.base)) (.cse34 (or .cse26 .cse27 .cse49 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse57 .cse58) (select .cse57 .cse16)))))) (.cse0 (or .cse54 .cse53 (and (or .cse27 .cse28 .cse30) .cse2) .cse56 .cse55)) (.cse9 (not .cse56)) (.cse20 (not .cse55)) (.cse4 (or .cse26 .cse27 .cse28 .cse30)) (.cse8 (not .cse1)) (.cse21 (or .cse1 .cse2)) (.cse23 (not .cse54)) (.cse14 (not (< c_~node_back~0 c_~node_size~0))) (.cse18 (not .cse53)) (.cse19 (not (<= 0 c_~node_back~0)))) (and .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse6 (select .cse7 (+ (* v_~client_back~0_170 4) ~client~0.offset)))) (or (= (select .cse5 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) .cse6) (not (<= 1 v_~manager_front~0_185)) (not (= (select .cse5 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse6)) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170))))) .cse8) (or .cse1 (forall ((v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (= (select .cse5 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select .cse7 (+ (* v_~client_back~0_170 4) ~client~0.offset))) (not (<= 1 v_~manager_front~0_185)) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or (and .cse4 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse10 (select (select .cse12 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse11 (select .cse12 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (= .cse10 (select .cse11 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (= .cse10 (select .cse11 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse8) (or .cse1 (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse13 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse13 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or .cse14 (and (or (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse15 c_~node~0.base) .cse16) (select (select .cse15 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 1 v_~manager_front~0_185)))) .cse2) .cse17) .cse18 .cse19) (or (not (< c_~manager_back~0 c_~manager_size~0)) (not (= (select .cse5 (+ c_~manager~0.offset (* c_~manager_back~0 4))) c_~ok~0)) (not (<= 0 c_~manager_back~0)) .cse3 .cse8) (or .cse20 (and .cse4 .cse21 (or (forall ((~manager_back~0 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (= (select .cse5 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse7 (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)))) (not (<= 1 v_~client_back~0_170)))) .cse8))) (or .cse14 (and .cse17 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse22 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse22 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse8) .cse21) .cse23 .cse19) (or .cse20 (and .cse4 .cse21 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse24 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse24 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse8))) (or .cse14 .cse23 (and .cse25 .cse21 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (= (select .cse5 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse5 (+ ~manager~0.offset (* v_~manager_front~0_185 4)))) (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0))) .cse8)) .cse19) (or .cse26 .cse27 .cse28 (= c_~update~0 .cse29) .cse30) (or .cse20 (and .cse4 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)) (not (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse31 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) (select (select .cse31 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset))))))) .cse8) .cse21)) (or .cse14 .cse18 (and .cse25 (or .cse2 (forall ((v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (= .cse32 (select .cse5 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))))))) .cse19) (= c_~safe~0 1) (or .cse14 .cse23 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse33 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse33 (+ ~manager~0.offset (* v_~manager_front~0_185 4))))))) .cse8) .cse21 .cse34) .cse19) (or (and .cse4 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse35 (select (select .cse37 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse36 (select .cse37 c_~manager~0.base))) (or (not (= .cse35 (select .cse36 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (<= 1 v_~manager_front~0_185)) (= .cse35 (select .cse36 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse8) (or .cse1 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse38 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse38 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse39 c_~node~0.base) .cse16) (select (select .cse39 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))))) .cse2) .cse34) .cse14 .cse18 .cse19) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse48 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse46 (or .cse26 .cse27 .cse49 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse50 .cse48))))))) (and .cse0 (or (and .cse4 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse40 (select (select .cse42 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse41 (select .cse42 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (not (= .cse40 (select .cse41 (+ ~manager~0.offset (* ~manager_back~0 4))))) (= .cse40 (select .cse41 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse8) (or .cse1 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse43 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse43 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or .cse20 (and .cse4 (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse44 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse44 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse8) .cse21)) (or .cse14 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse45 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse45 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse8) .cse21 .cse46) .cse23 .cse19) (or .cse14 .cse18 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse47 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse48))))) .cse2) .cse46) .cse19)))))))))) is different from false [2022-12-06 05:23:40,783 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse48 (* c_~node_back~0 4))) (let ((.cse47 (* c_~node_front~0 4)) (.cse7 (= c_~node_state~0 0)) (.cse57 (select |c_#memory_int| c_~node~0.base)) (.cse15 (+ .cse48 c_~node~0.offset))) (let ((.cse6 (= c_~node_state~0 1)) (.cse50 (= c_~manager_state~0 1)) (.cse49 (= c_~manager_state~0 0)) (.cse51 (<= c_~node_size~0 c_~node_front~0)) (.cse52 (<= c_~node_back~0 c_~node_front~0)) (.cse54 (= 2 c_~manager_state~0)) (.cse53 (= 3 c_~manager_state~0)) (.cse26 (select .cse57 .cse15)) (.cse43 (not .cse7)) (.cse44 (< c_~node_front~0 0)) (.cse45 (<= (+ c_~node_back~0 1) c_~node_front~0)) (.cse56 (+ .cse47 c_~node~0.offset))) (let ((.cse4 (select |c_#memory_int| c_~client~0.base)) (.cse16 (or .cse43 .cse44 .cse45 (forall ((v_ArrVal_705 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse58 .cse56) (select .cse58 .cse15)))))) (.cse24 (or .cse43 .cse44 .cse45 (= .cse26 (select .cse57 .cse56)))) (.cse2 (select |c_#memory_int| c_~manager~0.base)) (.cse28 (or .cse43 .cse44 .cse45 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse55 .cse56) (select .cse55 .cse15)))))) (.cse0 (or .cse50 .cse49 (and (or .cse44 .cse51 .cse52) .cse7) .cse54 .cse53)) (.cse8 (not .cse54)) (.cse19 (not .cse53)) (.cse1 (or .cse43 .cse44 .cse51 .cse52)) (.cse5 (not .cse6)) (.cse20 (or .cse6 .cse7)) (.cse22 (not .cse50)) (.cse13 (not (< c_~node_back~0 c_~node_size~0))) (.cse17 (not .cse49)) (.cse18 (not (<= 0 c_~node_back~0)))) (and .cse0 (or (and .cse1 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse3 (select .cse4 (+ (* v_~client_back~0_170 4) ~client~0.offset)))) (or (= (select .cse2 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) .cse3) (not (<= 1 v_~manager_front~0_185)) (not (= (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse3)) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170))))) .cse5) (or .cse6 (forall ((v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (= (select .cse2 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select .cse4 (+ (* v_~client_back~0_170 4) ~client~0.offset))) (not (<= 1 v_~manager_front~0_185)) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or (and .cse1 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse9 (select (select .cse11 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse10 (select .cse11 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (= .cse9 (select .cse10 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (= .cse9 (select .cse10 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse5) (or .cse6 (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse12 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse12 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or .cse13 (and (or (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse14 c_~node~0.base) .cse15) (select (select .cse14 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 1 v_~manager_front~0_185)))) .cse7) .cse16) .cse17 .cse18) (or .cse19 (and .cse1 .cse20 (or (forall ((~manager_back~0 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (= (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse4 (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)))) (not (<= 1 v_~client_back~0_170)))) .cse5))) (or .cse13 (and .cse16 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse21 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse21 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse5) .cse20) .cse22 .cse18) (or .cse19 (and .cse1 .cse20 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse23 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse23 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse5))) (or .cse13 .cse22 (and .cse24 .cse20 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (= (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse2 (+ ~manager~0.offset (* v_~manager_front~0_185 4)))) (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0))) .cse5)) .cse18) (or .cse19 (and .cse1 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)) (not (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse25 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) (select (select .cse25 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset))))))) .cse5) .cse20)) (or .cse13 .cse17 (and .cse24 (or .cse7 (forall ((v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (= .cse26 (select .cse2 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))))))) .cse18) (= c_~safe~0 1) (or .cse13 .cse22 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse27 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse27 (+ ~manager~0.offset (* v_~manager_front~0_185 4))))))) .cse5) .cse20 .cse28) .cse18) (or (and .cse1 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse29 (select (select .cse31 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse30 (select .cse31 c_~manager~0.base))) (or (not (= .cse29 (select .cse30 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (<= 1 v_~manager_front~0_185)) (= .cse29 (select .cse30 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse5) (or .cse6 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse32 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse32 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse33 c_~node~0.base) .cse15) (select (select .cse33 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))))) .cse7) .cse28) .cse13 .cse17 .cse18) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse42 (+ .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse40 (or .cse43 .cse44 .cse45 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse46 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse46 .cse42))))))) (and .cse0 (or (and .cse1 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse34 (select (select .cse36 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse35 (select .cse36 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (not (= .cse34 (select .cse35 (+ ~manager~0.offset (* ~manager_back~0 4))))) (= .cse34 (select .cse35 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse5) (or .cse6 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse37 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse37 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or .cse19 (and .cse1 (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse38 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse38 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse5) .cse20)) (or .cse13 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse39 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse39 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse5) .cse20 .cse40) .cse22 .cse18) (or .cse13 .cse17 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse41 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse42))))) .cse7) .cse40) .cse18)))))))))) is different from false [2022-12-06 05:23:43,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:23:45,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:23:47,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:23:50,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:23:51,001 INFO L130 PetriNetUnfolder]: 1805/3054 cut-off events. [2022-12-06 05:23:51,001 INFO L131 PetriNetUnfolder]: For 5410/5410 co-relation queries the response was YES. [2022-12-06 05:23:51,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 3054 events. 1805/3054 cut-off events. For 5410/5410 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17246 event pairs, 604 based on Foata normal form. 6/3049 useless extension candidates. Maximal degree in co-relation 9292. Up to 1283 conditions per place. [2022-12-06 05:23:51,012 INFO L137 encePairwiseOnDemand]: 10/32 looper letters, 134 selfloop transitions, 50 changer transitions 59/243 dead transitions. [2022-12-06 05:23:51,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 243 transitions, 1596 flow [2022-12-06 05:23:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 05:23:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 05:23:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-12-06 05:23:51,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2825 [2022-12-06 05:23:51,014 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 336 flow. Second operand 25 states and 226 transitions. [2022-12-06 05:23:51,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 243 transitions, 1596 flow [2022-12-06 05:23:51,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 243 transitions, 1496 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-12-06 05:23:51,024 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 834 flow [2022-12-06 05:23:51,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=834, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2022-12-06 05:23:51,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2022-12-06 05:23:51,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:51,025 INFO L89 Accepts]: Start accepts. Operand has 85 places, 91 transitions, 834 flow [2022-12-06 05:23:51,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:51,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:51,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 91 transitions, 834 flow [2022-12-06 05:23:51,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 91 transitions, 834 flow [2022-12-06 05:23:51,066 INFO L130 PetriNetUnfolder]: 53/359 cut-off events. [2022-12-06 05:23:51,066 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2022-12-06 05:23:51,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 359 events. 53/359 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2414 event pairs, 7 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 839. Up to 55 conditions per place. [2022-12-06 05:23:51,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 91 transitions, 834 flow [2022-12-06 05:23:51,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 05:24:14,304 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:24:14,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23279 [2022-12-06 05:24:14,304 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 870 flow [2022-12-06 05:24:14,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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 05:24:14,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:14,305 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:14,313 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 05:24:14,505 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,SelfDestructingSolverStorable13 [2022-12-06 05:24:14,505 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 1 more)] === [2022-12-06 05:24:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -731742440, now seen corresponding path program 1 times [2022-12-06 05:24:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:14,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198026366] [2022-12-06 05:24:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:14,924 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 05:24:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:14,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198026366] [2022-12-06 05:24:14,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198026366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034180871] [2022-12-06 05:24:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:14,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:14,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:14,926 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 05:24:14,928 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 05:24:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:15,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:24:15,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:15,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:15,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:15,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 301 [2022-12-06 05:24:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:15,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034180871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:15,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:15,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:24:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960203051] [2022-12-06 05:24:15,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:15,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:24:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:24:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:24:15,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:24:15,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 870 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 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 05:24:15,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:15,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:24:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:16,294 INFO L130 PetriNetUnfolder]: 2282/3921 cut-off events. [2022-12-06 05:24:16,294 INFO L131 PetriNetUnfolder]: For 9992/9992 co-relation queries the response was YES. [2022-12-06 05:24:16,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13184 conditions, 3921 events. 2282/3921 cut-off events. For 9992/9992 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23670 event pairs, 424 based on Foata normal form. 168/4075 useless extension candidates. Maximal degree in co-relation 12279. Up to 714 conditions per place. [2022-12-06 05:24:16,307 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 131 selfloop transitions, 48 changer transitions 29/208 dead transitions. [2022-12-06 05:24:16,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 208 transitions, 1785 flow [2022-12-06 05:24:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:24:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:24:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-06 05:24:16,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3504273504273504 [2022-12-06 05:24:16,308 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 870 flow. Second operand 12 states and 164 transitions. [2022-12-06 05:24:16,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 208 transitions, 1785 flow [2022-12-06 05:24:16,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 208 transitions, 1689 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-06 05:24:16,327 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 986 flow [2022-12-06 05:24:16,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=986, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2022-12-06 05:24:16,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:16,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:16,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 94 transitions, 986 flow [2022-12-06 05:24:16,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:16,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:16,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 94 transitions, 986 flow [2022-12-06 05:24:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 94 transitions, 986 flow [2022-12-06 05:24:16,374 INFO L130 PetriNetUnfolder]: 58/458 cut-off events. [2022-12-06 05:24:16,374 INFO L131 PetriNetUnfolder]: For 822/822 co-relation queries the response was YES. [2022-12-06 05:24:16,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 458 events. 58/458 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3462 event pairs, 9 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 1232. Up to 70 conditions per place. [2022-12-06 05:24:16,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 94 transitions, 986 flow [2022-12-06 05:24:16,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 05:24:16,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:16,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:24:16,379 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 986 flow [2022-12-06 05:24:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 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 05:24:16,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:16,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] [2022-12-06 05:24:16,387 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 05:24:16,584 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,SelfDestructingSolverStorable14 [2022-12-06 05:24:16,585 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 1 more)] === [2022-12-06 05:24:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 862727906, now seen corresponding path program 1 times [2022-12-06 05:24:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835142836] [2022-12-06 05:24:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:17,244 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 05:24:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835142836] [2022-12-06 05:24:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835142836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272866860] [2022-12-06 05:24:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:17,246 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 05:24:17,263 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 05:24:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:17,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:24:17,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:17,519 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 05:24:17,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:18,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:18,871 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 446 treesize of output 625 [2022-12-06 05:24:23,226 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 05:24:23,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272866860] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:23,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:23,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 05:24:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860496543] [2022-12-06 05:24:23,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:23,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:24:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:24:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:24:23,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:24:23,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 986 flow. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 05:24:23,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:23,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:24:23,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:24,371 INFO L130 PetriNetUnfolder]: 2677/4615 cut-off events. [2022-12-06 05:24:24,372 INFO L131 PetriNetUnfolder]: For 14287/14287 co-relation queries the response was YES. [2022-12-06 05:24:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16384 conditions, 4615 events. 2677/4615 cut-off events. For 14287/14287 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28816 event pairs, 631 based on Foata normal form. 6/4607 useless extension candidates. Maximal degree in co-relation 16349. Up to 1849 conditions per place. [2022-12-06 05:24:24,391 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 92 selfloop transitions, 53 changer transitions 32/177 dead transitions. [2022-12-06 05:24:24,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 177 transitions, 1747 flow [2022-12-06 05:24:24,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:24:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:24:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 05:24:24,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33641975308641975 [2022-12-06 05:24:24,392 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 986 flow. Second operand 9 states and 109 transitions. [2022-12-06 05:24:24,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 177 transitions, 1747 flow [2022-12-06 05:24:24,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 177 transitions, 1688 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 05:24:24,444 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 1268 flow [2022-12-06 05:24:24,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1268, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2022-12-06 05:24:24,445 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 74 predicate places. [2022-12-06 05:24:24,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:24,445 INFO L89 Accepts]: Start accepts. Operand has 103 places, 108 transitions, 1268 flow [2022-12-06 05:24:24,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:24,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:24,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 108 transitions, 1268 flow [2022-12-06 05:24:24,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 108 transitions, 1268 flow [2022-12-06 05:24:24,507 INFO L130 PetriNetUnfolder]: 69/551 cut-off events. [2022-12-06 05:24:24,507 INFO L131 PetriNetUnfolder]: For 1128/1128 co-relation queries the response was YES. [2022-12-06 05:24:24,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 551 events. 69/551 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4424 event pairs, 11 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1359. Up to 68 conditions per place. [2022-12-06 05:24:24,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 108 transitions, 1268 flow [2022-12-06 05:24:24,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-06 05:24:24,511 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:24,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 05:24:24,512 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 1268 flow [2022-12-06 05:24:24,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 05:24:24,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:24,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:24,532 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 05:24:24,717 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,SelfDestructingSolverStorable15 [2022-12-06 05:24:24,717 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 1 more)] === [2022-12-06 05:24:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1922663671, now seen corresponding path program 1 times [2022-12-06 05:24:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:24,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32488939] [2022-12-06 05:24:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:24,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32488939] [2022-12-06 05:24:25,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32488939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483882425] [2022-12-06 05:24:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:25,216 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:25,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:24:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:25,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:24:25,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:25,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:30,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:30,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 807 treesize of output 1909 [2022-12-06 05:26:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:17,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483882425] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:26:17,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:26:17,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-06 05:26:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892536142] [2022-12-06 05:26:17,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:26:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:26:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:26:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:26:17,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:26:17,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 1268 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:17,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:17,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:26:17,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:20,259 INFO L130 PetriNetUnfolder]: 2876/4994 cut-off events. [2022-12-06 05:26:20,260 INFO L131 PetriNetUnfolder]: For 17755/17755 co-relation queries the response was YES. [2022-12-06 05:26:20,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17941 conditions, 4994 events. 2876/4994 cut-off events. For 17755/17755 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 31932 event pairs, 631 based on Foata normal form. 81/5058 useless extension candidates. Maximal degree in co-relation 16550. Up to 1410 conditions per place. [2022-12-06 05:26:20,275 INFO L137 encePairwiseOnDemand]: 17/36 looper letters, 87 selfloop transitions, 63 changer transitions 83/233 dead transitions. [2022-12-06 05:26:20,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 233 transitions, 2147 flow [2022-12-06 05:26:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:26:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:26:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 174 transitions. [2022-12-06 05:26:20,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-06 05:26:20,276 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 1268 flow. Second operand 15 states and 174 transitions. [2022-12-06 05:26:20,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 233 transitions, 2147 flow [2022-12-06 05:26:20,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 233 transitions, 2106 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:26:20,333 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 1392 flow [2022-12-06 05:26:20,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1392, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2022-12-06 05:26:20,333 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 90 predicate places. [2022-12-06 05:26:20,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:20,333 INFO L89 Accepts]: Start accepts. Operand has 119 places, 108 transitions, 1392 flow [2022-12-06 05:26:20,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:20,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:20,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 1392 flow [2022-12-06 05:26:20,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 108 transitions, 1392 flow [2022-12-06 05:26:20,390 INFO L130 PetriNetUnfolder]: 66/541 cut-off events. [2022-12-06 05:26:20,390 INFO L131 PetriNetUnfolder]: For 1421/1421 co-relation queries the response was YES. [2022-12-06 05:26:20,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 541 events. 66/541 cut-off events. For 1421/1421 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4278 event pairs, 10 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 1486. Up to 72 conditions per place. [2022-12-06 05:26:20,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 108 transitions, 1392 flow [2022-12-06 05:26:20,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 634 [2022-12-06 05:26:20,406 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:20,406 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:20,406 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:20,406 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:20,407 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:20,407 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,037 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,037 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,037 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,037 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,037 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,038 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,675 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,675 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,675 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,675 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,675 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:21,675 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:22,236 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:26:22,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1904 [2022-12-06 05:26:22,237 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 1382 flow [2022-12-06 05:26:22,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:22,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:22,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:22,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:26:22,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:26:22,443 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:26:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1980893660, now seen corresponding path program 1 times [2022-12-06 05:26:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:22,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466052098] [2022-12-06 05:26:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:22,889 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 05:26:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:22,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466052098] [2022-12-06 05:26:22,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466052098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:26:22,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580289093] [2022-12-06 05:26:22,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:22,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:22,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:22,891 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:26:22,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:26:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:23,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:26:23,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:26:23,209 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 05:26:23,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:26:24,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:26:24,847 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 434 treesize of output 638 [2022-12-06 05:26:26,974 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 05:26:26,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580289093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:26:26,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:26:26,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:26:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920133208] [2022-12-06 05:26:26,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:26:26,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:26:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:26:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:26:26,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:26:26,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 1382 flow. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:26,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:26,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:26:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:27,894 INFO L130 PetriNetUnfolder]: 2357/4143 cut-off events. [2022-12-06 05:26:27,894 INFO L131 PetriNetUnfolder]: For 19358/19358 co-relation queries the response was YES. [2022-12-06 05:26:27,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15623 conditions, 4143 events. 2357/4143 cut-off events. For 19358/19358 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26068 event pairs, 578 based on Foata normal form. 48/4180 useless extension candidates. Maximal degree in co-relation 14372. Up to 896 conditions per place. [2022-12-06 05:26:27,935 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 80 selfloop transitions, 47 changer transitions 34/161 dead transitions. [2022-12-06 05:26:27,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 161 transitions, 1799 flow [2022-12-06 05:26:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:26:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:26:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2022-12-06 05:26:27,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-06 05:26:27,937 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 1382 flow. Second operand 8 states and 108 transitions. [2022-12-06 05:26:27,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 161 transitions, 1799 flow [2022-12-06 05:26:28,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 161 transitions, 1691 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-06 05:26:28,054 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 1235 flow [2022-12-06 05:26:28,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1235, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2022-12-06 05:26:28,054 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2022-12-06 05:26:28,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:28,055 INFO L89 Accepts]: Start accepts. Operand has 110 places, 93 transitions, 1235 flow [2022-12-06 05:26:28,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:28,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:28,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 93 transitions, 1235 flow [2022-12-06 05:26:28,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 93 transitions, 1235 flow [2022-12-06 05:26:28,110 INFO L130 PetriNetUnfolder]: 56/508 cut-off events. [2022-12-06 05:26:28,110 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2022-12-06 05:26:28,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 508 events. 56/508 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4008 event pairs, 10 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 1339. Up to 69 conditions per place. [2022-12-06 05:26:28,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 93 transitions, 1235 flow [2022-12-06 05:26:28,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 05:26:28,125 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,126 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,126 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,126 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,126 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,126 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,760 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,760 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,760 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,760 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,760 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:28,760 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,403 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,403 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,403 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,403 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,403 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,403 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,962 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,963 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,963 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,963 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,963 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:29,963 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,456 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,457 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,457 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,457 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,457 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,457 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,960 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,960 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,960 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,960 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,961 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:30,961 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:31,673 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:31,674 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:31,674 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:31,674 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:31,674 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:31,674 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,240 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,240 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,240 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,240 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,240 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,240 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,825 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,825 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,825 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,825 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,825 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:32,825 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:26:33,463 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:26:33,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5409 [2022-12-06 05:26:33,464 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 1314 flow [2022-12-06 05:26:33,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:33,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:33,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:33,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 05:26:33,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 05:26:33,665 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:26:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -598957885, now seen corresponding path program 1 times [2022-12-06 05:26:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:33,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964612010] [2022-12-06 05:26:33,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:26:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:33,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964612010] [2022-12-06 05:26:33,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964612010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:26:33,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550998711] [2022-12-06 05:26:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:33,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:33,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:33,893 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:26:33,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:26:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:34,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:26:34,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:26:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:26:34,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:26:34,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:26:34,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 284 [2022-12-06 05:26:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:26:34,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550998711] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:26:34,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:26:34,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:26:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460749877] [2022-12-06 05:26:34,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:26:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:26:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:26:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:26:34,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:26:34,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 1314 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:34,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:34,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:26:34,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:35,357 INFO L130 PetriNetUnfolder]: 1819/3307 cut-off events. [2022-12-06 05:26:35,357 INFO L131 PetriNetUnfolder]: For 20291/20291 co-relation queries the response was YES. [2022-12-06 05:26:35,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 3307 events. 1819/3307 cut-off events. For 20291/20291 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20887 event pairs, 1266 based on Foata normal form. 72/3370 useless extension candidates. Maximal degree in co-relation 11387. Up to 1968 conditions per place. [2022-12-06 05:26:35,395 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 86 selfloop transitions, 3 changer transitions 32/121 dead transitions. [2022-12-06 05:26:35,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 121 transitions, 1466 flow [2022-12-06 05:26:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:26:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:26:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 05:26:35,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3659574468085106 [2022-12-06 05:26:35,396 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 1314 flow. Second operand 5 states and 86 transitions. [2022-12-06 05:26:35,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 121 transitions, 1466 flow [2022-12-06 05:26:35,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 121 transitions, 1314 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-12-06 05:26:35,438 INFO L231 Difference]: Finished difference. Result has 102 places, 66 transitions, 736 flow [2022-12-06 05:26:35,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=736, PETRI_PLACES=102, PETRI_TRANSITIONS=66} [2022-12-06 05:26:35,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2022-12-06 05:26:35,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:35,438 INFO L89 Accepts]: Start accepts. Operand has 102 places, 66 transitions, 736 flow [2022-12-06 05:26:35,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:35,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:35,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 66 transitions, 736 flow [2022-12-06 05:26:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 66 transitions, 736 flow [2022-12-06 05:26:35,471 INFO L130 PetriNetUnfolder]: 32/286 cut-off events. [2022-12-06 05:26:35,471 INFO L131 PetriNetUnfolder]: For 499/499 co-relation queries the response was YES. [2022-12-06 05:26:35,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 286 events. 32/286 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1832 event pairs, 7 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 677. Up to 38 conditions per place. [2022-12-06 05:26:35,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 66 transitions, 736 flow [2022-12-06 05:26:35,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 05:26:39,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:39,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4245 [2022-12-06 05:26:39,683 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 65 transitions, 732 flow [2022-12-06 05:26:39,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:39,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:39,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:39,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 05:26:39,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:39,888 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:26:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1876943732, now seen corresponding path program 1 times [2022-12-06 05:26:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:39,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170274348] [2022-12-06 05:26:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170274348] [2022-12-06 05:26:40,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170274348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:26:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684821431] [2022-12-06 05:26:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:40,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:40,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:26:40,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:26:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:40,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:26:40,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:26:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:26:40,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:26:40,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684821431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:40,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:26:40,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 05:26:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865034029] [2022-12-06 05:26:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:40,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:26:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:26:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:26:40,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:26:40,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 65 transitions, 732 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:40,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:40,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:26:40,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:41,319 INFO L130 PetriNetUnfolder]: 1649/2922 cut-off events. [2022-12-06 05:26:41,320 INFO L131 PetriNetUnfolder]: For 12521/12521 co-relation queries the response was YES. [2022-12-06 05:26:41,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10530 conditions, 2922 events. 1649/2922 cut-off events. For 12521/12521 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17345 event pairs, 1333 based on Foata normal form. 24/2941 useless extension candidates. Maximal degree in co-relation 9558. Up to 1748 conditions per place. [2022-12-06 05:26:41,332 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 80 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2022-12-06 05:26:41,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 1188 flow [2022-12-06 05:26:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:26:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:26:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-06 05:26:41,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32456140350877194 [2022-12-06 05:26:41,338 INFO L175 Difference]: Start difference. First operand has 92 places, 65 transitions, 732 flow. Second operand 6 states and 74 transitions. [2022-12-06 05:26:41,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 1188 flow [2022-12-06 05:26:41,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 1045 flow, removed 17 selfloop flow, removed 15 redundant places. [2022-12-06 05:26:41,358 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 753 flow [2022-12-06 05:26:41,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=753, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2022-12-06 05:26:41,358 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2022-12-06 05:26:41,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:41,359 INFO L89 Accepts]: Start accepts. Operand has 84 places, 70 transitions, 753 flow [2022-12-06 05:26:41,359 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:41,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:41,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 70 transitions, 753 flow [2022-12-06 05:26:41,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 70 transitions, 753 flow [2022-12-06 05:26:41,395 INFO L130 PetriNetUnfolder]: 37/364 cut-off events. [2022-12-06 05:26:41,396 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2022-12-06 05:26:41,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 364 events. 37/364 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2571 event pairs, 9 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 766. Up to 50 conditions per place. [2022-12-06 05:26:41,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 70 transitions, 753 flow [2022-12-06 05:26:41,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 05:26:41,398 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:41,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 05:26:41,398 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 753 flow [2022-12-06 05:26:41,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:41,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:41,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:41,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:26:41,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:41,604 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:26:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash -595068223, now seen corresponding path program 1 times [2022-12-06 05:26:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:41,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099399571] [2022-12-06 05:26:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:42,483 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 05:26:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099399571] [2022-12-06 05:26:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099399571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:26:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384333755] [2022-12-06 05:26:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:42,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:42,485 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:26:42,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 05:26:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:42,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:26:42,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:26:42,989 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 05:26:42,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:26:58,101 WARN L233 SmtUtils]: Spent 13.14s on a formula simplification. DAG size of input: 125 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:27:09,349 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 1110 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 05:27:09,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:27:09,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 884 treesize of output 4449 Received shutdown request... [2022-12-06 05:36:26,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:36:26,657 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:36:26,657 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 05:36:26,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 05:36:26,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:26,864 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ∧-228-5-8-3-5-3-5-1 context. [2022-12-06 05:36:26,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:36:26,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:36:26,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:36:26,866 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:26,868 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:36:26,868 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:36:26,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:36:26 BasicIcfg [2022-12-06 05:36:26,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:36:26,870 INFO L158 Benchmark]: Toolchain (without parser) took 845289.61ms. Allocated memory was 163.6MB in the beginning and 879.8MB in the end (delta: 716.2MB). Free memory was 139.0MB in the beginning and 811.0MB in the end (delta: -672.0MB). Peak memory consumption was 561.4MB. Max. memory is 8.0GB. [2022-12-06 05:36:26,871 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:36:26,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.76ms. Allocated memory is still 163.6MB. Free memory was 138.5MB in the beginning and 123.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 05:36:26,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.38ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 121.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:26,871 INFO L158 Benchmark]: Boogie Preprocessor took 48.48ms. Allocated memory is still 163.6MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:26,871 INFO L158 Benchmark]: RCFGBuilder took 764.38ms. Allocated memory is still 163.6MB. Free memory was 118.6MB in the beginning and 72.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:26,871 INFO L158 Benchmark]: TraceAbstraction took 844209.24ms. Allocated memory was 163.6MB in the beginning and 879.8MB in the end (delta: 716.2MB). Free memory was 71.4MB in the beginning and 811.0MB in the end (delta: -739.6MB). Peak memory consumption was 493.2MB. Max. memory is 8.0GB. [2022-12-06 05:36:26,872 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.09ms. Allocated memory is still 163.6MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.76ms. Allocated memory is still 163.6MB. Free memory was 138.5MB in the beginning and 123.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.38ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 121.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.48ms. Allocated memory is still 163.6MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 764.38ms. Allocated memory is still 163.6MB. Free memory was 118.6MB in the beginning and 72.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 844209.24ms. Allocated memory was 163.6MB in the beginning and 879.8MB in the end (delta: 716.2MB). Free memory was 71.4MB in the beginning and 811.0MB in the end (delta: -739.6MB). Peak memory consumption was 493.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 223 PlacesBefore, 29 PlacesAfterwards, 240 TransitionsBefore, 25 TransitionsAfterwards, 2442 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 154 TrivialYvCompositions, 40 ConcurrentYvCompositions, 16 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1539, independent: 1539, independent conditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1539, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1164, unknown conditional: 0, unknown unconditional: 1164] , Statistics on independence cache: Total cache size (in pairs): 2182, Positive cache size: 2182, Positive conditional cache size: 0, Positive unconditional cache size: 2182, 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, 26 PlacesBefore, 26 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 120 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: 3.6s, 30 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 120 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, 30 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 102 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, 31 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 96 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.6s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 14, 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: 4.0s, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 130 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): 14, Positive cache size: 14, Positive conditional cache size: 14, 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: 7.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 41 PlacesBefore, 41 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 206 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 46 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 218 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 6.4s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 11.2s, 69 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 306 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 4.6s, 58 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 224 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 23.2s, 84 PlacesBefore, 84 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 97 PlacesBefore, 97 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 516 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 640 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 1.8s, 113 PlacesBefore, 111 PlacesAfterwards, 108 TransitionsBefore, 106 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 5, independent conditional: 5, 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): 77, Positive cache size: 77, Positive conditional cache size: 77, 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: 5.4s, 110 PlacesBefore, 109 PlacesAfterwards, 93 TransitionsBefore, 94 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, 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: 45, independent: 45, independent conditional: 45, 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: 45, independent: 45, independent conditional: 45, 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: 45, independent: 45, independent conditional: 45, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 217, Positive conditional cache size: 217, 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: 4.2s, 93 PlacesBefore, 92 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 332 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): 217, Positive cache size: 217, Positive conditional cache size: 217, 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, 84 PlacesBefore, 84 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 378 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): 217, Positive cache size: 217, Positive conditional cache size: 217, 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: 162]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ∧-228-5-8-3-5-3-5-1 context. - TimeoutResultAtElement [Line: 154]: 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 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ∧-228-5-8-3-5-3-5-1 context. - TimeoutResultAtElement [Line: 155]: 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 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ∧-228-5-8-3-5-3-5-1 context. - TimeoutResultAtElement [Line: 156]: 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 21 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ∧-228-5-8-3-5-3-5-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 844.1s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 41 mSolverCounterUnknown, 1755 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1755 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4138 IncrementalHoareTripleChecker+Invalid, 4509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 0 mSDtfsCounter, 4138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1392occurred in iteration=17, InterpolantAutomatonStates: 154, 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.5s SatisfiabilityAnalysisTime, 148.6s InterpolantComputationTime, 675 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 849 ConstructedInterpolants, 23 QuantifiedInterpolants, 24506 SizeOfPredicates, 582 NumberOfNonLiveVariables, 4015 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 45 InterpolantComputations, 9 PerfectInterpolantSequences, 72/133 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