/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:47:32,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:47:32,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:47:32,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:47:32,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:47:32,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:47:32,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:47:32,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:47:32,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:47:32,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:47:32,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:47:32,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:47:32,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:47:32,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:47:32,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:47:32,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:47:32,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:47:32,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:47:32,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:47:32,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:47:32,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:47:32,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:47:32,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:47:32,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:47:32,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:47:32,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:47:32,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:47:32,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:47:32,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:47:32,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:47:32,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:47:32,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:47:32,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:47:32,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:47:32,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:47:32,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:47:32,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:47:32,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:47:32,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:47:32,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:47:32,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:47:32,928 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-RepeatedSemanticLbe.epf [2022-12-13 07:47:32,958 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:47:32,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:47:32,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:47:32,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:47:32,960 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:47:32,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:47:32,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:47:32,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:47:32,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:47:32,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:47:32,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:47:32,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:47:32,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:47:32,963 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:47:32,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:47:32,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:47:32,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:47:32,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:47:32,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:47:32,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:47:32,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:47:32,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:47:32,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:47:32,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:47:32,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:47:32,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:47:32,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:47:32,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:47:32,965 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:47:33,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:47:33,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:47:33,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:47:33,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:47:33,315 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:47:33,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-13 07:47:34,495 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:47:34,744 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:47:34,744 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-13 07:47:34,750 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb619356/94e96565ba744c13a5d8aa7e9690926c/FLAG614130fd8 [2022-12-13 07:47:34,763 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb619356/94e96565ba744c13a5d8aa7e9690926c [2022-12-13 07:47:34,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:47:34,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:47:34,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:47:34,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:47:34,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:47:34,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:34" (1/1) ... [2022-12-13 07:47:34,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec30b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:34, skipping insertion in model container [2022-12-13 07:47:34,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:34" (1/1) ... [2022-12-13 07:47:34,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:47:34,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:47:34,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,944 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-channel-sum.wvr.c[2947,2960] [2022-12-13 07:47:34,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:47:34,960 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:47:34,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:34,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:34,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:47:35,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:47:35,005 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-channel-sum.wvr.c[2947,2960] [2022-12-13 07:47:35,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:47:35,023 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:47:35,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35 WrapperNode [2022-12-13 07:47:35,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:47:35,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:47:35,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:47:35,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:47:35,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,079 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-12-13 07:47:35,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:47:35,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:47:35,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:47:35,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:47:35,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,113 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:47:35,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:47:35,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:47:35,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:47:35,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (1/1) ... [2022-12-13 07:47:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:47:35,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:35,153 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-13 07:47:35,174 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-13 07:47:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:47:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:47:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:47:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:47:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:47:35,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:47:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:47:35,192 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:47:35,344 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:47:35,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:47:35,608 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:47:35,709 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:47:35,710 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 07:47:35,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:35 BoogieIcfgContainer [2022-12-13 07:47:35,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:47:35,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:47:35,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:47:35,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:47:35,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:47:34" (1/3) ... [2022-12-13 07:47:35,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aab8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:47:35, skipping insertion in model container [2022-12-13 07:47:35,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:35" (2/3) ... [2022-12-13 07:47:35,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aab8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:47:35, skipping insertion in model container [2022-12-13 07:47:35,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:35" (3/3) ... [2022-12-13 07:47:35,719 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-12-13 07:47:35,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:47:35,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:47:35,737 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:47:35,807 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 07:47:35,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 278 flow [2022-12-13 07:47:35,900 INFO L130 PetriNetUnfolder]: 11/129 cut-off events. [2022-12-13 07:47:35,900 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:47:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 07:47:35,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 278 flow [2022-12-13 07:47:35,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 121 transitions, 254 flow [2022-12-13 07:47:35,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:35,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 121 transitions, 254 flow [2022-12-13 07:47:35,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 121 transitions, 254 flow [2022-12-13 07:47:35,963 INFO L130 PetriNetUnfolder]: 11/121 cut-off events. [2022-12-13 07:47:35,963 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:47:35,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 121 events. 11/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 122 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 07:47:35,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 121 transitions, 254 flow [2022-12-13 07:47:35,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-13 07:47:40,771 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-13 07:47:40,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:47:40,792 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;@4b9d6280, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:47:40,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 07:47:40,798 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-13 07:47:40,798 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:47:40,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:40,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:40,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1602862863, now seen corresponding path program 1 times [2022-12-13 07:47:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496548066] [2022-12-13 07:47:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:41,233 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-13 07:47:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:41,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496548066] [2022-12-13 07:47:41,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496548066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:47:41,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:47:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:47:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300009954] [2022-12-13 07:47:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:47:41,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:47:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:47:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:47:41,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-13 07:47:41,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:47:41,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:41,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-13 07:47:41,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:41,340 INFO L130 PetriNetUnfolder]: 64/121 cut-off events. [2022-12-13 07:47:41,340 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 07:47:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 121 events. 64/121 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 350 event pairs, 13 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 170. Up to 66 conditions per place. [2022-12-13 07:47:41,342 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 19 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2022-12-13 07:47:41,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2022-12-13 07:47:41,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:47:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:47:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-13 07:47:41,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-13 07:47:41,355 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2022-12-13 07:47:41,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 28 transitions, 127 flow [2022-12-13 07:47:41,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 24 transitions, 105 flow [2022-12-13 07:47:41,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:41,359 INFO L89 Accepts]: Start accepts. Operand has 24 places, 24 transitions, 105 flow [2022-12-13 07:47:41,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:41,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:41,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 24 transitions, 105 flow [2022-12-13 07:47:41,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 24 transitions, 105 flow [2022-12-13 07:47:41,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 07:47:41,370 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:47:41,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 07:47:41,372 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 24 transitions, 105 flow [2022-12-13 07:47:41,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:47:41,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:41,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:41,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:47:41,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash -729500201, now seen corresponding path program 1 times [2022-12-13 07:47:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:41,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337634037] [2022-12-13 07:47:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:41,600 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-13 07:47:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:41,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337634037] [2022-12-13 07:47:41,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337634037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:47:41,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:47:41,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:47:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568796930] [2022-12-13 07:47:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:47:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:47:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:47:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:47:41,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 07:47:41,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 24 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-13 07:47:41,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:41,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 07:47:41,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:41,667 INFO L130 PetriNetUnfolder]: 46/87 cut-off events. [2022-12-13 07:47:41,667 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 07:47:41,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 87 events. 46/87 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 1 based on Foata normal form. 6/72 useless extension candidates. Maximal degree in co-relation 213. Up to 65 conditions per place. [2022-12-13 07:47:41,669 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 24 selfloop transitions, 4 changer transitions 2/31 dead transitions. [2022-12-13 07:47:41,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 191 flow [2022-12-13 07:47:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:47:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:47:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 07:47:41,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 07:47:41,671 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-13 07:47:41,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 31 transitions, 191 flow [2022-12-13 07:47:41,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 29 transitions, 179 flow [2022-12-13 07:47:41,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:41,673 INFO L89 Accepts]: Start accepts. Operand has 27 places, 29 transitions, 179 flow [2022-12-13 07:47:41,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:41,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:41,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 29 transitions, 179 flow [2022-12-13 07:47:41,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 29 transitions, 179 flow [2022-12-13 07:47:41,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 07:47:41,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:47:41,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 07:47:41,767 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 29 transitions, 179 flow [2022-12-13 07:47:41,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-13 07:47:41,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:41,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:41,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:47:41,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 670808102, now seen corresponding path program 1 times [2022-12-13 07:47:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573224160] [2022-12-13 07:47:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:41,941 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-13 07:47:41,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:41,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573224160] [2022-12-13 07:47:41,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573224160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:47:41,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:47:41,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:47:41,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756289210] [2022-12-13 07:47:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:47:41,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:47:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:47:41,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:47:41,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-13 07:47:41,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 29 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:47:41,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:41,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-13 07:47:41,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:42,013 INFO L130 PetriNetUnfolder]: 45/93 cut-off events. [2022-12-13 07:47:42,013 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 07:47:42,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 93 events. 45/93 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 4/79 useless extension candidates. Maximal degree in co-relation 247. Up to 67 conditions per place. [2022-12-13 07:47:42,017 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 24 selfloop transitions, 2 changer transitions 8/38 dead transitions. [2022-12-13 07:47:42,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 310 flow [2022-12-13 07:47:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:47:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:47:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-13 07:47:42,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-13 07:47:42,021 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-13 07:47:42,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 38 transitions, 310 flow [2022-12-13 07:47:42,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 30 transitions, 237 flow [2022-12-13 07:47:42,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:42,024 INFO L89 Accepts]: Start accepts. Operand has 29 places, 30 transitions, 237 flow [2022-12-13 07:47:42,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:42,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:42,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 30 transitions, 237 flow [2022-12-13 07:47:42,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 30 transitions, 237 flow [2022-12-13 07:47:42,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 07:47:43,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:47:43,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1021 [2022-12-13 07:47:43,046 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 29 transitions, 229 flow [2022-12-13 07:47:43,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:47:43,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:43,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:43,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:47:43,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash -680217884, now seen corresponding path program 1 times [2022-12-13 07:47:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:43,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617521969] [2022-12-13 07:47:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:43,230 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-13 07:47:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:43,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617521969] [2022-12-13 07:47:43,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617521969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:47:43,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053207740] [2022-12-13 07:47:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:43,235 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-13 07:47:43,263 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-13 07:47:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:43,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 07:47:43,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:47:43,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 148 treesize of output 116 [2022-12-13 07:47:43,678 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-13 07:47:43,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:47:43,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 6 [2022-12-13 07:47:43,892 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-13 07:47:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053207740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:47:43,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:47:43,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 10 [2022-12-13 07:47:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048398681] [2022-12-13 07:47:43,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:47:43,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:47:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:43,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:47:43,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:47:43,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 07:47:43,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 29 transitions, 229 flow. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-13 07:47:43,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:43,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 07:47:43,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:44,037 INFO L130 PetriNetUnfolder]: 46/91 cut-off events. [2022-12-13 07:47:44,038 INFO L131 PetriNetUnfolder]: For 64/66 co-relation queries the response was YES. [2022-12-13 07:47:44,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 91 events. 46/91 cut-off events. For 64/66 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 175 event pairs, 2 based on Foata normal form. 10/80 useless extension candidates. Maximal degree in co-relation 373. Up to 79 conditions per place. [2022-12-13 07:47:44,039 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 24 selfloop transitions, 5 changer transitions 11/41 dead transitions. [2022-12-13 07:47:44,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 405 flow [2022-12-13 07:47:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:47:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:47:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-12-13 07:47:44,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3092105263157895 [2022-12-13 07:47:44,041 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2022-12-13 07:47:44,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 41 transitions, 405 flow [2022-12-13 07:47:44,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 296 flow [2022-12-13 07:47:44,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:44,043 INFO L89 Accepts]: Start accepts. Operand has 31 places, 30 transitions, 296 flow [2022-12-13 07:47:44,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:44,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:44,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 30 transitions, 296 flow [2022-12-13 07:47:44,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 30 transitions, 296 flow [2022-12-13 07:47:44,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 07:47:44,045 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:47:44,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:47:44,046 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 296 flow [2022-12-13 07:47:44,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-13 07:47:44,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:44,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:44,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:47:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:44,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1169952180, now seen corresponding path program 2 times [2022-12-13 07:47:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:44,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948344525] [2022-12-13 07:47:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:44,867 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-13 07:47:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:44,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948344525] [2022-12-13 07:47:44,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948344525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:47:44,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439423779] [2022-12-13 07:47:44,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:47:44,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:44,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:44,870 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-13 07:47:44,872 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-13 07:47:44,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:47:44,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:47:44,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 07:47:44,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:47:44,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 07:47:45,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:47:45,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:47:45,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-12-13 07:47:45,220 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-13 07:47:45,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:47:45,793 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ (select .cse0 .cse1) c_~sum~0) 0)) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ (select .cse3 .cse1) c_~sum~0))) (not (= (select .cse3 .cse2) 1))))))) (not (< c_~front~0 (+ c_~back~0 1))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-12-13 07:47:45,795 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-13 07:47:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439423779] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:47:45,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:47:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 18 [2022-12-13 07:47:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230595104] [2022-12-13 07:47:45,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:47:45,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:47:45,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:47:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=255, Unknown=3, NotChecked=34, Total=380 [2022-12-13 07:47:45,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:47:45,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 296 flow. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-13 07:47:45,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:45,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:47:45,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:46,788 INFO L130 PetriNetUnfolder]: 164/305 cut-off events. [2022-12-13 07:47:46,788 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-13 07:47:46,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 305 events. 164/305 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1007 event pairs, 3 based on Foata normal form. 6/226 useless extension candidates. Maximal degree in co-relation 1292. Up to 285 conditions per place. [2022-12-13 07:47:46,792 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 59 selfloop transitions, 24 changer transitions 42/125 dead transitions. [2022-12-13 07:47:46,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 125 transitions, 1514 flow [2022-12-13 07:47:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 07:47:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 07:47:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 104 transitions. [2022-12-13 07:47:46,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3219814241486068 [2022-12-13 07:47:46,798 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2022-12-13 07:47:46,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 125 transitions, 1514 flow [2022-12-13 07:47:46,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 83 transitions, 974 flow [2022-12-13 07:47:46,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:46,806 INFO L89 Accepts]: Start accepts. Operand has 46 places, 83 transitions, 974 flow [2022-12-13 07:47:46,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:46,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:46,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 83 transitions, 974 flow [2022-12-13 07:47:46,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 83 transitions, 974 flow [2022-12-13 07:47:46,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:47:50,745 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:47:50,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3941 [2022-12-13 07:47:50,746 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 81 transitions, 950 flow [2022-12-13 07:47:50,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-13 07:47:50,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:50,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:50,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:47:50,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:50,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1916089790, now seen corresponding path program 1 times [2022-12-13 07:47:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629405411] [2022-12-13 07:47:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:51,667 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-13 07:47:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:51,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629405411] [2022-12-13 07:47:51,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629405411] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:47:51,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336442598] [2022-12-13 07:47:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:51,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:51,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:51,673 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-13 07:47:51,694 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-13 07:47:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:51,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 07:47:51,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:47:51,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-12-13 07:47:51,869 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-13 07:47:51,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:47:52,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:47:52,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 154 [2022-12-13 07:47:52,286 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-13 07:47:52,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336442598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:47:52,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:47:52,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-13 07:47:52,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722121253] [2022-12-13 07:47:52,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:47:52,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:47:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:47:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:47:52,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:47:52,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 81 transitions, 950 flow. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-13 07:47:52,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:52,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:47:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:52,647 INFO L130 PetriNetUnfolder]: 198/350 cut-off events. [2022-12-13 07:47:52,648 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2022-12-13 07:47:52,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 350 events. 198/350 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1170 event pairs, 2 based on Foata normal form. 3/268 useless extension candidates. Maximal degree in co-relation 1184. Up to 332 conditions per place. [2022-12-13 07:47:52,651 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 89 selfloop transitions, 33 changer transitions 22/144 dead transitions. [2022-12-13 07:47:52,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 144 transitions, 2004 flow [2022-12-13 07:47:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:47:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:47:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-13 07:47:52,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2571428571428571 [2022-12-13 07:47:52,657 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 36 predicate places. [2022-12-13 07:47:52,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 144 transitions, 2004 flow [2022-12-13 07:47:52,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 122 transitions, 1678 flow [2022-12-13 07:47:52,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:52,663 INFO L89 Accepts]: Start accepts. Operand has 57 places, 122 transitions, 1678 flow [2022-12-13 07:47:52,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:52,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:52,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 122 transitions, 1678 flow [2022-12-13 07:47:52,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 122 transitions, 1678 flow [2022-12-13 07:47:52,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:47:52,669 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:47:52,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:47:52,670 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 122 transitions, 1678 flow [2022-12-13 07:47:52,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-13 07:47:52,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:52,671 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:52,679 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-13 07:47:52,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:52,877 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1604091430, now seen corresponding path program 1 times [2022-12-13 07:47:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:52,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539840326] [2022-12-13 07:47:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:47:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539840326] [2022-12-13 07:47:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539840326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:47:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514174894] [2022-12-13 07:47:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:53,042 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-13 07:47:53,072 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-13 07:47:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:53,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 07:47:53,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:47:53,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 148 treesize of output 116 [2022-12-13 07:47:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:47:53,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:47:53,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12 treesize of output 4 [2022-12-13 07:47:53,382 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:47:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:47:53,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514174894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:47:53,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:47:53,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-13 07:47:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909301612] [2022-12-13 07:47:53,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:47:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:47:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:53,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:47:53,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:47:53,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 07:47:53,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 122 transitions, 1678 flow. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 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-13 07:47:53,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:53,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 07:47:53,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:53,850 INFO L130 PetriNetUnfolder]: 286/552 cut-off events. [2022-12-13 07:47:53,850 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2022-12-13 07:47:53,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 552 events. 286/552 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2297 event pairs, 4 based on Foata normal form. 40/469 useless extension candidates. Maximal degree in co-relation 1860. Up to 527 conditions per place. [2022-12-13 07:47:53,854 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 135 selfloop transitions, 35 changer transitions 64/235 dead transitions. [2022-12-13 07:47:53,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 235 transitions, 3738 flow [2022-12-13 07:47:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 07:47:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 07:47:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 141 transitions. [2022-12-13 07:47:53,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3533834586466165 [2022-12-13 07:47:53,858 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 53 predicate places. [2022-12-13 07:47:53,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 235 transitions, 3738 flow [2022-12-13 07:47:53,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 171 transitions, 2738 flow [2022-12-13 07:47:53,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:53,868 INFO L89 Accepts]: Start accepts. Operand has 60 places, 171 transitions, 2738 flow [2022-12-13 07:47:53,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:53,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:53,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 171 transitions, 2738 flow [2022-12-13 07:47:53,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 171 transitions, 2738 flow [2022-12-13 07:47:53,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:47:53,874 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:47:53,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:47:53,874 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 171 transitions, 2738 flow [2022-12-13 07:47:53,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 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-13 07:47:53,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:53,875 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:53,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:47:54,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:54,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:47:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1837320058, now seen corresponding path program 1 times [2022-12-13 07:47:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:54,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533987568] [2022-12-13 07:47:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:47:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533987568] [2022-12-13 07:47:55,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533987568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:47:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543260907] [2022-12-13 07:47:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:55,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:55,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:55,064 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-13 07:47:55,066 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-13 07:47:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:55,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:47:55,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:47:55,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:47:55,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-13 07:47:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:47:55,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:47:55,885 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-13 07:47:55,886 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 278 treesize of output 248 [2022-12-13 07:47:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:47:56,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543260907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:47:56,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:47:56,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2022-12-13 07:47:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944983107] [2022-12-13 07:47:56,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:47:56,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:47:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:47:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:47:56,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:47:56,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 171 transitions, 2738 flow. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 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-13 07:47:56,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:56,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:47:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:58,208 INFO L130 PetriNetUnfolder]: 497/910 cut-off events. [2022-12-13 07:47:58,209 INFO L131 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2022-12-13 07:47:58,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 910 events. 497/910 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4317 event pairs, 2 based on Foata normal form. 9/724 useless extension candidates. Maximal degree in co-relation 5121. Up to 891 conditions per place. [2022-12-13 07:47:58,220 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 153 selfloop transitions, 43 changer transitions 179/375 dead transitions. [2022-12-13 07:47:58,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 375 transitions, 6746 flow [2022-12-13 07:47:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 07:47:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-13 07:47:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 211 transitions. [2022-12-13 07:47:58,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2573170731707317 [2022-12-13 07:47:58,225 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 78 predicate places. [2022-12-13 07:47:58,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 375 transitions, 6746 flow [2022-12-13 07:47:58,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 196 transitions, 3506 flow [2022-12-13 07:47:58,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:58,240 INFO L89 Accepts]: Start accepts. Operand has 78 places, 196 transitions, 3506 flow [2022-12-13 07:47:58,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:58,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:58,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 196 transitions, 3506 flow [2022-12-13 07:47:58,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 196 transitions, 3506 flow [2022-12-13 07:47:58,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:00,659 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:00,660 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2420 [2022-12-13 07:48:00,660 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 195 transitions, 3488 flow [2022-12-13 07:48:00,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 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-13 07:48:00,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:00,660 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:00,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:48:00,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:00,868 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:00,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash 984693434, now seen corresponding path program 2 times [2022-12-13 07:48:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:00,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058092444] [2022-12-13 07:48:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058092444] [2022-12-13 07:48:01,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058092444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604884667] [2022-12-13 07:48:01,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:48:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:01,953 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-13 07:48:01,956 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-13 07:48:02,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:48:02,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:48:02,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 07:48:02,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:02,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:02,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-13 07:48:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:02,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:02,819 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-12-13 07:48:02,819 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 276 treesize of output 234 [2022-12-13 07:48:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604884667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:03,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:03,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2022-12-13 07:48:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018807857] [2022-12-13 07:48:03,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:03,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:48:03,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:48:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:48:03,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:48:03,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 195 transitions, 3488 flow. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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-13 07:48:03,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:03,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:48:03,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:05,755 INFO L130 PetriNetUnfolder]: 687/1269 cut-off events. [2022-12-13 07:48:05,755 INFO L131 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2022-12-13 07:48:05,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12592 conditions, 1269 events. 687/1269 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6590 event pairs, 2 based on Foata normal form. 35/1015 useless extension candidates. Maximal degree in co-relation 8616. Up to 1251 conditions per place. [2022-12-13 07:48:05,766 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 177 selfloop transitions, 98 changer transitions 245/520 dead transitions. [2022-12-13 07:48:05,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 520 transitions, 10436 flow [2022-12-13 07:48:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 07:48:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-13 07:48:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 266 transitions. [2022-12-13 07:48:05,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25333333333333335 [2022-12-13 07:48:05,768 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 104 predicate places. [2022-12-13 07:48:05,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 520 transitions, 10436 flow [2022-12-13 07:48:05,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 275 transitions, 5442 flow [2022-12-13 07:48:05,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:05,789 INFO L89 Accepts]: Start accepts. Operand has 92 places, 275 transitions, 5442 flow [2022-12-13 07:48:05,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:05,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:05,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 275 transitions, 5442 flow [2022-12-13 07:48:05,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 275 transitions, 5442 flow [2022-12-13 07:48:05,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:05,799 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:05,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:48:05,800 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 275 transitions, 5442 flow [2022-12-13 07:48:05,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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-13 07:48:05,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:05,800 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:05,807 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-13 07:48:06,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:06,007 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:06,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash -362920682, now seen corresponding path program 1 times [2022-12-13 07:48:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:06,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031222128] [2022-12-13 07:48:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031222128] [2022-12-13 07:48:07,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031222128] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30683560] [2022-12-13 07:48:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:07,376 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-13 07:48:07,379 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-13 07:48:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:07,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 07:48:07,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:07,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:07,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-13 07:48:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:07,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:08,074 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-12-13 07:48:08,074 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 268 treesize of output 226 [2022-12-13 07:48:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:08,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30683560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:08,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:08,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2022-12-13 07:48:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729311829] [2022-12-13 07:48:08,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:08,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:48:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:48:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:48:08,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:48:08,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 275 transitions, 5442 flow. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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-13 07:48:08,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:08,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:48:08,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:10,149 INFO L130 PetriNetUnfolder]: 814/1417 cut-off events. [2022-12-13 07:48:10,149 INFO L131 PetriNetUnfolder]: For 539/539 co-relation queries the response was YES. [2022-12-13 07:48:10,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15380 conditions, 1417 events. 814/1417 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7055 event pairs, 0 based on Foata normal form. 6/1115 useless extension candidates. Maximal degree in co-relation 12765. Up to 1400 conditions per place. [2022-12-13 07:48:10,163 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 396 selfloop transitions, 124 changer transitions 62/582 dead transitions. [2022-12-13 07:48:10,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 582 transitions, 12736 flow [2022-12-13 07:48:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 07:48:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 07:48:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2022-12-13 07:48:10,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-13 07:48:10,166 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 108 predicate places. [2022-12-13 07:48:10,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 582 transitions, 12736 flow [2022-12-13 07:48:10,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 520 transitions, 11336 flow [2022-12-13 07:48:10,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:10,193 INFO L89 Accepts]: Start accepts. Operand has 124 places, 520 transitions, 11336 flow [2022-12-13 07:48:10,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:10,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:10,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 520 transitions, 11336 flow [2022-12-13 07:48:10,207 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 520 transitions, 11336 flow [2022-12-13 07:48:10,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:10,209 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:10,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 07:48:10,210 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 520 transitions, 11336 flow [2022-12-13 07:48:10,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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-13 07:48:10,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:10,210 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:10,221 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-13 07:48:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:10,416 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -278230099, now seen corresponding path program 2 times [2022-12-13 07:48:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237651320] [2022-12-13 07:48:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:10,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237651320] [2022-12-13 07:48:10,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237651320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:10,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773712154] [2022-12-13 07:48:10,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:48:10,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:10,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:10,589 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-13 07:48:10,591 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-13 07:48:10,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:48:10,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:48:10,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 07:48:10,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:10,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:10,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 160 [2022-12-13 07:48:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:10,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:11,182 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 07:48:11,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 181 [2022-12-13 07:48:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:11,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773712154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:11,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:11,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 14 [2022-12-13 07:48:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103949] [2022-12-13 07:48:11,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:48:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:48:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:48:11,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:48:11,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 520 transitions, 11336 flow. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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-13 07:48:11,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:11,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:48:11,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:11,939 INFO L130 PetriNetUnfolder]: 892/1573 cut-off events. [2022-12-13 07:48:11,939 INFO L131 PetriNetUnfolder]: For 559/559 co-relation queries the response was YES. [2022-12-13 07:48:11,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18664 conditions, 1573 events. 892/1573 cut-off events. For 559/559 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8201 event pairs, 0 based on Foata normal form. 44/1277 useless extension candidates. Maximal degree in co-relation 16426. Up to 1556 conditions per place. [2022-12-13 07:48:11,955 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 476 selfloop transitions, 134 changer transitions 49/659 dead transitions. [2022-12-13 07:48:11,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 659 transitions, 15732 flow [2022-12-13 07:48:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:48:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:48:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2022-12-13 07:48:11,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2722222222222222 [2022-12-13 07:48:11,957 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 118 predicate places. [2022-12-13 07:48:11,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 659 transitions, 15732 flow [2022-12-13 07:48:11,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 610 transitions, 14564 flow [2022-12-13 07:48:11,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:11,985 INFO L89 Accepts]: Start accepts. Operand has 133 places, 610 transitions, 14564 flow [2022-12-13 07:48:11,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:11,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:11,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 610 transitions, 14564 flow [2022-12-13 07:48:12,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 610 transitions, 14564 flow [2022-12-13 07:48:12,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:12,007 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:12,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 07:48:12,008 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 610 transitions, 14564 flow [2022-12-13 07:48:12,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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-13 07:48:12,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:12,008 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:12,022 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-13 07:48:12,214 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,SelfDestructingSolverStorable10 [2022-12-13 07:48:12,215 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1949143235, now seen corresponding path program 3 times [2022-12-13 07:48:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:12,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540614426] [2022-12-13 07:48:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:12,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540614426] [2022-12-13 07:48:12,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540614426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:12,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233874283] [2022-12-13 07:48:12,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:48:12,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:12,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:12,394 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-13 07:48:12,396 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-13 07:48:12,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:48:12,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:48:12,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 07:48:12,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:12,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:12,748 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 39 treesize of output 12 [2022-12-13 07:48:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:12,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:13,164 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-12-13 07:48:13,165 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 265 treesize of output 199 [2022-12-13 07:48:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:13,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233874283] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:13,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:13,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 23 [2022-12-13 07:48:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523907081] [2022-12-13 07:48:13,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:13,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:48:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:13,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:48:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:48:13,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:48:13,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 610 transitions, 14564 flow. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 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-13 07:48:13,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:13,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:48:13,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:14,874 INFO L130 PetriNetUnfolder]: 1683/2894 cut-off events. [2022-12-13 07:48:14,874 INFO L131 PetriNetUnfolder]: For 767/767 co-relation queries the response was YES. [2022-12-13 07:48:14,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37301 conditions, 2894 events. 1683/2894 cut-off events. For 767/767 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 16893 event pairs, 0 based on Foata normal form. 0/2290 useless extension candidates. Maximal degree in co-relation 34514. Up to 2877 conditions per place. [2022-12-13 07:48:14,898 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 702 selfloop transitions, 487 changer transitions 0/1189 dead transitions. [2022-12-13 07:48:14,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 07:48:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-13 07:48:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 218 transitions. [2022-12-13 07:48:14,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2868421052631579 [2022-12-13 07:48:14,900 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 145 predicate places. [2022-12-13 07:48:14,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:14,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:14,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:14,961 INFO L89 Accepts]: Start accepts. Operand has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:14,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:14,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:14,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:15,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:15,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:15,011 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:15,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 07:48:15,012 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 1189 transitions, 30802 flow [2022-12-13 07:48:15,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 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-13 07:48:15,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:15,013 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:15,019 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-13 07:48:15,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:15,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1613388874, now seen corresponding path program 4 times [2022-12-13 07:48:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:15,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559497513] [2022-12-13 07:48:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:16,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:16,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559497513] [2022-12-13 07:48:16,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559497513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:16,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609088412] [2022-12-13 07:48:16,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:48:16,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:16,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:16,493 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-13 07:48:16,515 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-13 07:48:16,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:48:16,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:48:16,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:48:16,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:16,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:16,995 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 72 treesize of output 18 [2022-12-13 07:48:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:17,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:17,746 INFO L321 Elim1Store]: treesize reduction 64, result has 56.5 percent of original size [2022-12-13 07:48:17,746 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 318 treesize of output 282 [2022-12-13 07:48:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:18,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609088412] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:18,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:18,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-12-13 07:48:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603880352] [2022-12-13 07:48:18,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:48:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:48:18,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2022-12-13 07:48:18,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:48:18,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 1189 transitions, 30802 flow. Second operand has 29 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 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-13 07:48:18,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:18,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:48:18,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:26,246 INFO L130 PetriNetUnfolder]: 4452/7752 cut-off events. [2022-12-13 07:48:26,246 INFO L131 PetriNetUnfolder]: For 1717/1717 co-relation queries the response was YES. [2022-12-13 07:48:26,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108021 conditions, 7752 events. 4452/7752 cut-off events. For 1717/1717 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 52754 event pairs, 0 based on Foata normal form. 30/6057 useless extension candidates. Maximal degree in co-relation 70026. Up to 7733 conditions per place. [2022-12-13 07:48:26,308 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 2140 selfloop transitions, 718 changer transitions 272/3130 dead transitions. [2022-12-13 07:48:26,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 3130 transitions, 87694 flow [2022-12-13 07:48:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-13 07:48:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-12-13 07:48:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 457 transitions. [2022-12-13 07:48:26,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29294871794871796 [2022-12-13 07:48:26,312 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 222 predicate places. [2022-12-13 07:48:26,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 3130 transitions, 87694 flow [2022-12-13 07:48:26,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 2858 transitions, 79898 flow [2022-12-13 07:48:26,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:26,474 INFO L89 Accepts]: Start accepts. Operand has 236 places, 2858 transitions, 79898 flow [2022-12-13 07:48:26,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:26,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:26,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 2858 transitions, 79898 flow [2022-12-13 07:48:26,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 2858 transitions, 79898 flow [2022-12-13 07:48:26,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:29,697 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:29,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3225 [2022-12-13 07:48:29,698 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 2857 transitions, 79870 flow [2022-12-13 07:48:29,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 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-13 07:48:29,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:29,698 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:29,704 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-13 07:48:29,901 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,SelfDestructingSolverStorable12 [2022-12-13 07:48:29,901 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 582264834, now seen corresponding path program 5 times [2022-12-13 07:48:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606108752] [2022-12-13 07:48:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:31,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606108752] [2022-12-13 07:48:31,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606108752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:31,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281798570] [2022-12-13 07:48:31,393 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:48:31,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:31,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:31,394 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-13 07:48:31,400 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-13 07:48:31,492 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:48:31,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:48:31,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 07:48:31,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:31,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:48:31,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:48:31,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-13 07:48:31,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:48:31,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:48:31,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:31,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 23 [2022-12-13 07:48:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:31,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:32,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281798570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:32,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:32,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-12-13 07:48:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67731621] [2022-12-13 07:48:32,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:32,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 07:48:32,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:32,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 07:48:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=578, Unknown=2, NotChecked=0, Total=756 [2022-12-13 07:48:32,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:48:32,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 2857 transitions, 79870 flow. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 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-13 07:48:32,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:32,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:48:32,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:41,791 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 93 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:48:49,877 INFO L130 PetriNetUnfolder]: 5787/9904 cut-off events. [2022-12-13 07:48:49,877 INFO L131 PetriNetUnfolder]: For 1906/1906 co-relation queries the response was YES. [2022-12-13 07:48:49,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147718 conditions, 9904 events. 5787/9904 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 69927 event pairs, 0 based on Foata normal form. 20/7782 useless extension candidates. Maximal degree in co-relation 99056. Up to 9877 conditions per place. [2022-12-13 07:48:49,964 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 3068 selfloop transitions, 756 changer transitions 182/4006 dead transitions. [2022-12-13 07:48:49,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 4006 transitions, 119994 flow [2022-12-13 07:48:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 07:48:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-13 07:48:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 221 transitions. [2022-12-13 07:48:49,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23917748917748918 [2022-12-13 07:48:49,966 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 256 predicate places. [2022-12-13 07:48:49,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 4006 transitions, 119994 flow [2022-12-13 07:48:50,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 3824 transitions, 114414 flow [2022-12-13 07:48:50,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:50,187 INFO L89 Accepts]: Start accepts. Operand has 274 places, 3824 transitions, 114414 flow [2022-12-13 07:48:50,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:50,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:50,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 3824 transitions, 114414 flow [2022-12-13 07:48:50,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 3824 transitions, 114414 flow [2022-12-13 07:48:50,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:50,397 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:50,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 07:48:50,398 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 3824 transitions, 114414 flow [2022-12-13 07:48:50,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 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-13 07:48:50,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:50,399 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:50,409 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-13 07:48:50,605 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,SelfDestructingSolverStorable13 [2022-12-13 07:48:50,606 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:48:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1029149860, now seen corresponding path program 6 times [2022-12-13 07:48:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:50,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789689314] [2022-12-13 07:48:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789689314] [2022-12-13 07:48:51,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789689314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120956720] [2022-12-13 07:48:51,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:48:51,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:51,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:51,820 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-13 07:48:51,822 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-13 07:48:51,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:48:51,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:48:51,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:48:51,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:52,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 43 [2022-12-13 07:48:52,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:48:52,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:48:52,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:48:52,435 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 72 treesize of output 18 [2022-12-13 07:48:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:52,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:48:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:53,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120956720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:48:53,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:48:53,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 29 [2022-12-13 07:48:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933985696] [2022-12-13 07:48:53,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:48:53,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:48:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:53,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:48:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=765, Unknown=1, NotChecked=0, Total=930 [2022-12-13 07:48:53,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:48:53,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 3824 transitions, 114414 flow. Second operand has 31 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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-13 07:48:53,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:53,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:48:53,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:06,196 INFO L130 PetriNetUnfolder]: 4958/8526 cut-off events. [2022-12-13 07:49:06,196 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2022-12-13 07:49:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135822 conditions, 8526 events. 4958/8526 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 58837 event pairs, 0 based on Foata normal form. 13/6781 useless extension candidates. Maximal degree in co-relation 68074. Up to 8499 conditions per place. [2022-12-13 07:49:06,255 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 2822 selfloop transitions, 558 changer transitions 97/3477 dead transitions. [2022-12-13 07:49:06,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 3477 transitions, 111124 flow [2022-12-13 07:49:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 07:49:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-13 07:49:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 194 transitions. [2022-12-13 07:49:06,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20082815734989648 [2022-12-13 07:49:06,258 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 295 predicate places. [2022-12-13 07:49:06,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 3477 transitions, 111124 flow [2022-12-13 07:49:06,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 3380 transitions, 108006 flow [2022-12-13 07:49:06,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:06,400 INFO L89 Accepts]: Start accepts. Operand has 311 places, 3380 transitions, 108006 flow [2022-12-13 07:49:06,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:06,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:06,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 3380 transitions, 108006 flow [2022-12-13 07:49:06,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 3380 transitions, 108006 flow [2022-12-13 07:49:06,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:06,495 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:06,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 07:49:06,496 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 3380 transitions, 108006 flow [2022-12-13 07:49:06,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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-13 07:49:06,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:06,496 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:06,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 07:49:06,697 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,SelfDestructingSolverStorable14 [2022-12-13 07:49:06,698 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:49:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 287087976, now seen corresponding path program 1 times [2022-12-13 07:49:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:06,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167065781] [2022-12-13 07:49:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:09,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167065781] [2022-12-13 07:49:09,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167065781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041280884] [2022-12-13 07:49:09,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:09,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:09,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:09,011 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-13 07:49:09,013 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-13 07:49:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:09,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 07:49:09,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:09,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:49:09,424 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 72 treesize of output 18 [2022-12-13 07:49:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:09,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:10,291 INFO L321 Elim1Store]: treesize reduction 64, result has 56.5 percent of original size [2022-12-13 07:49:10,292 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 318 treesize of output 282 [2022-12-13 07:49:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:10,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041280884] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:49:10,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:49:10,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-12-13 07:49:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540032614] [2022-12-13 07:49:10,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:49:10,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:49:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:49:10,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:49:10,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:49:10,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 3380 transitions, 108006 flow. Second operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 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-13 07:49:10,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:10,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:49:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:22,541 INFO L130 PetriNetUnfolder]: 6856/11720 cut-off events. [2022-12-13 07:49:22,541 INFO L131 PetriNetUnfolder]: For 1932/1932 co-relation queries the response was YES. [2022-12-13 07:49:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198431 conditions, 11720 events. 6856/11720 cut-off events. For 1932/1932 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 85683 event pairs, 0 based on Foata normal form. 13/9313 useless extension candidates. Maximal degree in co-relation 81898. Up to 11693 conditions per place. [2022-12-13 07:49:22,642 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 3705 selfloop transitions, 890 changer transitions 164/4759 dead transitions. [2022-12-13 07:49:22,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 4759 transitions, 161594 flow [2022-12-13 07:49:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 07:49:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-13 07:49:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 256 transitions. [2022-12-13 07:49:22,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20317460317460317 [2022-12-13 07:49:22,645 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 348 predicate places. [2022-12-13 07:49:22,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 370 places, 4759 transitions, 161594 flow [2022-12-13 07:49:22,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 367 places, 4595 transitions, 155940 flow [2022-12-13 07:49:22,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:22,852 INFO L89 Accepts]: Start accepts. Operand has 367 places, 4595 transitions, 155940 flow [2022-12-13 07:49:22,877 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:22,877 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:22,877 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 4595 transitions, 155940 flow [2022-12-13 07:49:22,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 4595 transitions, 155940 flow [2022-12-13 07:49:22,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:22,989 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:22,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 07:49:22,990 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 4595 transitions, 155940 flow [2022-12-13 07:49:22,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 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-13 07:49:22,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:22,990 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:23,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:49:23,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 07:49:23,197 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:49:23,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1710561211, now seen corresponding path program 1 times [2022-12-13 07:49:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:23,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009055806] [2022-12-13 07:49:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:25,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009055806] [2022-12-13 07:49:25,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009055806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:25,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70058304] [2022-12-13 07:49:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:25,408 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-13 07:49:25,411 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-13 07:49:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:25,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 07:49:25,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:25,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:49:25,823 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 72 treesize of output 18 [2022-12-13 07:49:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:25,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:26,506 INFO L321 Elim1Store]: treesize reduction 64, result has 56.5 percent of original size [2022-12-13 07:49:26,506 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 318 treesize of output 282 [2022-12-13 07:49:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:27,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70058304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:49:27,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:49:27,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-12-13 07:49:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628352568] [2022-12-13 07:49:27,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:49:27,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:49:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:49:27,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:49:27,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:49:27,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 4595 transitions, 155940 flow. Second operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 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-13 07:49:27,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:27,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:49:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:47,851 INFO L130 PetriNetUnfolder]: 9763/16597 cut-off events. [2022-12-13 07:49:47,852 INFO L131 PetriNetUnfolder]: For 2907/2907 co-relation queries the response was YES. [2022-12-13 07:49:47,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297507 conditions, 16597 events. 9763/16597 cut-off events. For 2907/2907 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 128656 event pairs, 0 based on Foata normal form. 38/13203 useless extension candidates. Maximal degree in co-relation 99586. Up to 16563 conditions per place. [2022-12-13 07:49:47,970 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 5314 selfloop transitions, 1230 changer transitions 189/6733 dead transitions. [2022-12-13 07:49:47,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 6733 transitions, 241990 flow [2022-12-13 07:49:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 07:49:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-13 07:49:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 214 transitions. [2022-12-13 07:49:47,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20796890184645286 [2022-12-13 07:49:47,972 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 393 predicate places. [2022-12-13 07:49:47,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 415 places, 6733 transitions, 241990 flow [2022-12-13 07:49:48,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 412 places, 6544 transitions, 235054 flow [2022-12-13 07:49:48,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:48,280 INFO L89 Accepts]: Start accepts. Operand has 412 places, 6544 transitions, 235054 flow [2022-12-13 07:49:48,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:48,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:48,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 412 places, 6544 transitions, 235054 flow [2022-12-13 07:49:48,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 412 places, 6544 transitions, 235054 flow [2022-12-13 07:49:48,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:53,069 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:49:53,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4791 [2022-12-13 07:49:53,070 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 6543 transitions, 235018 flow [2022-12-13 07:49:53,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 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-13 07:49:53,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:53,070 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:53,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 07:49:53,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:53,276 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:49:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -606147040, now seen corresponding path program 1 times [2022-12-13 07:49:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:53,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840949846] [2022-12-13 07:49:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:55,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:55,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840949846] [2022-12-13 07:49:55,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840949846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:55,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244364516] [2022-12-13 07:49:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:55,495 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-13 07:49:55,497 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-13 07:49:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:55,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 07:49:55,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:55,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:49:55,898 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 72 treesize of output 18 [2022-12-13 07:49:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:55,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:56,628 INFO L321 Elim1Store]: treesize reduction 64, result has 56.5 percent of original size [2022-12-13 07:49:56,628 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 324 treesize of output 288 [2022-12-13 07:49:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:57,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244364516] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:49:57,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:49:57,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-13 07:49:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418259019] [2022-12-13 07:49:57,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:49:57,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 07:49:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 07:49:57,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-12-13 07:49:57,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:49:57,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 6543 transitions, 235018 flow. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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-13 07:49:57,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:57,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:49:57,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:44,207 INFO L130 PetriNetUnfolder]: 12433/21041 cut-off events. [2022-12-13 07:50:44,208 INFO L131 PetriNetUnfolder]: For 3182/3182 co-relation queries the response was YES. [2022-12-13 07:50:44,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398355 conditions, 21041 events. 12433/21041 cut-off events. For 3182/3182 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 167697 event pairs, 0 based on Foata normal form. 15/16826 useless extension candidates. Maximal degree in co-relation 117733. Up to 21008 conditions per place. [2022-12-13 07:50:44,376 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 6556 selfloop transitions, 1773 changer transitions 210/8539 dead transitions. [2022-12-13 07:50:44,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 8539 transitions, 323936 flow [2022-12-13 07:50:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-13 07:50:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-13 07:50:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 290 transitions. [2022-12-13 07:50:44,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24871355060034306 [2022-12-13 07:50:44,378 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 441 predicate places. [2022-12-13 07:50:44,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 463 places, 8539 transitions, 323936 flow [2022-12-13 07:50:44,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 8329 transitions, 315866 flow [2022-12-13 07:50:44,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:44,906 INFO L89 Accepts]: Start accepts. Operand has 459 places, 8329 transitions, 315866 flow [2022-12-13 07:50:44,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:44,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:44,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 459 places, 8329 transitions, 315866 flow [2022-12-13 07:50:45,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 8329 transitions, 315866 flow [2022-12-13 07:50:45,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:50:45,327 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:45,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 422 [2022-12-13 07:50:45,328 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 8329 transitions, 315866 flow [2022-12-13 07:50:45,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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-13 07:50:45,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:45,328 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:45,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:45,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 07:50:45,531 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:50:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2057676471, now seen corresponding path program 1 times [2022-12-13 07:50:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:45,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524271432] [2022-12-13 07:50:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:48,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524271432] [2022-12-13 07:50:48,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524271432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:48,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529680390] [2022-12-13 07:50:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:48,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:48,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:48,348 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:48,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 07:50:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:48,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 07:50:48,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:48,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:50:48,850 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 72 treesize of output 18 [2022-12-13 07:50:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:48,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:49,807 INFO L321 Elim1Store]: treesize reduction 40, result has 72.8 percent of original size [2022-12-13 07:50:49,807 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 332 treesize of output 320 [2022-12-13 07:50:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:51,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529680390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:51,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:51,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-12-13 07:50:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874839589] [2022-12-13 07:50:51,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:51,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:50:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:50:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2022-12-13 07:50:51,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:50:51,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 8329 transitions, 315866 flow. Second operand has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-13 07:50:51,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:51,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:50:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:15,857 INFO L130 PetriNetUnfolder]: 17139/28924 cut-off events. [2022-12-13 07:52:15,857 INFO L131 PetriNetUnfolder]: For 4149/4149 co-relation queries the response was YES. [2022-12-13 07:52:15,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576460 conditions, 28924 events. 17139/28924 cut-off events. For 4149/4149 co-relation queries the response was YES. Maximal size of possible extension queue 1943. Compared 241793 event pairs, 0 based on Foata normal form. 54/23151 useless extension candidates. Maximal degree in co-relation 140352. Up to 28882 conditions per place. [2022-12-13 07:52:16,096 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 9509 selfloop transitions, 2021 changer transitions 210/11740 dead transitions. [2022-12-13 07:52:16,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 11740 transitions, 468776 flow [2022-12-13 07:52:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-13 07:52:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-13 07:52:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 257 transitions. [2022-12-13 07:52:16,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20141065830721003 [2022-12-13 07:52:16,098 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 494 predicate places. [2022-12-13 07:52:16,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 516 places, 11740 transitions, 468776 flow [2022-12-13 07:52:16,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 513 places, 11530 transitions, 460244 flow [2022-12-13 07:52:16,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:16,798 INFO L89 Accepts]: Start accepts. Operand has 513 places, 11530 transitions, 460244 flow [2022-12-13 07:52:16,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:16,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:16,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 513 places, 11530 transitions, 460244 flow [2022-12-13 07:52:17,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 513 places, 11530 transitions, 460244 flow [2022-12-13 07:52:17,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:23,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:52:23,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7121 [2022-12-13 07:52:23,918 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 11529 transitions, 460204 flow [2022-12-13 07:52:23,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-13 07:52:23,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:23,919 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:23,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 07:52:24,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:24,125 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:52:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2004111015, now seen corresponding path program 2 times [2022-12-13 07:52:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:24,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257582406] [2022-12-13 07:52:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:24,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:24,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257582406] [2022-12-13 07:52:24,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257582406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:24,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633113619] [2022-12-13 07:52:24,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:52:24,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:24,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:24,276 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:24,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 07:52:24,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:52:24,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:24,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:52:24,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:24,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:52:24,623 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 236 treesize of output 168 [2022-12-13 07:52:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:24,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:25,016 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-12-13 07:52:25,016 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 259 treesize of output 193 [2022-12-13 07:52:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:25,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633113619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:25,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:25,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 17 [2022-12-13 07:52:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690472695] [2022-12-13 07:52:25,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:25,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:52:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:52:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:52:25,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 07:52:25,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 11529 transitions, 460204 flow. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 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-13 07:52:25,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:25,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 07:52:25,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:55,127 INFO L130 PetriNetUnfolder]: 19075/32299 cut-off events. [2022-12-13 07:54:55,128 INFO L131 PetriNetUnfolder]: For 3800/3800 co-relation queries the response was YES. [2022-12-13 07:54:55,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676151 conditions, 32299 events. 19075/32299 cut-off events. For 3800/3800 co-relation queries the response was YES. Maximal size of possible extension queue 2189. Compared 276754 event pairs, 0 based on Foata normal form. 308/26242 useless extension candidates. Maximal degree in co-relation 189407. Up to 32258 conditions per place. [2022-12-13 07:54:55,529 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 10889 selfloop transitions, 1907 changer transitions 374/13170 dead transitions. [2022-12-13 07:54:55,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 13170 transitions, 552114 flow [2022-12-13 07:54:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 07:54:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 07:54:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2022-12-13 07:54:55,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24094202898550723 [2022-12-13 07:54:55,539 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 493 predicate places. [2022-12-13 07:54:55,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 515 places, 13170 transitions, 552114 flow [2022-12-13 07:54:55,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 514 places, 12796 transitions, 536406 flow [2022-12-13 07:54:56,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:56,292 INFO L89 Accepts]: Start accepts. Operand has 514 places, 12796 transitions, 536406 flow [2022-12-13 07:54:56,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:56,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:56,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 514 places, 12796 transitions, 536406 flow [2022-12-13 07:54:57,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 514 places, 12796 transitions, 536406 flow [2022-12-13 07:54:57,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:54:57,034 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:57,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 743 [2022-12-13 07:54:57,035 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 12796 transitions, 536406 flow [2022-12-13 07:54:57,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 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-13 07:54:57,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:57,035 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:57,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 07:54:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:54:57,240 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:54:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 279420759, now seen corresponding path program 1 times [2022-12-13 07:54:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:57,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922299748] [2022-12-13 07:54:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922299748] [2022-12-13 07:55:00,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922299748] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:55:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228049115] [2022-12-13 07:55:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:00,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:55:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:55:00,658 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:55:00,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 07:55:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:00,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 07:55:00,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:55:01,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:55:01,054 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 72 treesize of output 18 [2022-12-13 07:55:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:01,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:55:01,750 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-13 07:55:01,751 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 328 treesize of output 330 [2022-12-13 07:55:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:03,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228049115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:55:03,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:55:03,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-12-13 07:55:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31106288] [2022-12-13 07:55:03,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:55:03,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:55:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:55:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2022-12-13 07:55:03,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 07:55:03,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 12796 transitions, 536406 flow. Second operand has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-13 07:55:03,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:03,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 07:55:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:30,447 INFO L130 PetriNetUnfolder]: 25531/43008 cut-off events. [2022-12-13 07:58:30,447 INFO L131 PetriNetUnfolder]: For 5360/5360 co-relation queries the response was YES. [2022-12-13 07:58:30,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943408 conditions, 43008 events. 25531/43008 cut-off events. For 5360/5360 co-relation queries the response was YES. Maximal size of possible extension queue 2854. Compared 380127 event pairs, 0 based on Foata normal form. 31/34609 useless extension candidates. Maximal degree in co-relation 240266. Up to 42958 conditions per place. [2022-12-13 07:58:30,850 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 14122 selfloop transitions, 3089 changer transitions 315/17526 dead transitions. [2022-12-13 07:58:30,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 17526 transitions, 769908 flow [2022-12-13 07:58:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 07:58:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-13 07:58:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 258 transitions. [2022-12-13 07:58:30,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20031055900621117 [2022-12-13 07:58:30,853 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 547 predicate places. [2022-12-13 07:58:30,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 569 places, 17526 transitions, 769908 flow [2022-12-13 07:58:31,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 566 places, 17211 transitions, 755862 flow [2022-12-13 07:58:32,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:32,072 INFO L89 Accepts]: Start accepts. Operand has 566 places, 17211 transitions, 755862 flow [2022-12-13 07:58:32,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:32,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:32,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 566 places, 17211 transitions, 755862 flow [2022-12-13 07:58:33,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 566 places, 17211 transitions, 755862 flow [2022-12-13 07:58:33,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:58:41,779 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:58:41,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9707 [2022-12-13 07:58:41,779 INFO L495 AbstractCegarLoop]: Abstraction has has 565 places, 17210 transitions, 755818 flow [2022-12-13 07:58:41,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-13 07:58:41,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:41,780 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:58:41,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 07:58:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:41,980 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:58:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash -656577870, now seen corresponding path program 7 times [2022-12-13 07:58:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:41,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975607802] [2022-12-13 07:58:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:58:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:42,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975607802] [2022-12-13 07:58:42,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975607802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:58:42,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180717020] [2022-12-13 07:58:42,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:58:42,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:58:42,210 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:58:42,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 07:58:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:42,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:58:42,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:58:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:58:42,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:58:42,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180717020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:58:42,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:58:42,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-13 07:58:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874908474] [2022-12-13 07:58:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:58:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:58:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:58:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:58:42,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 07:58:42,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 17210 transitions, 755818 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-13 07:58:42,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:42,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 07:58:42,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:01:04,988 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:01:04,988 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-13 08:01:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:01:04,996 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 08:01:05,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 08:01:05,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:01:05,197 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/24 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 481357 conditions, 21037 events (12312/21036 cut-off events. For 4448/4448 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 192044 event pairs, 0 based on Foata normal form. 28/18698 useless extension candidates. Maximal degree in co-relation 118916. Up to 20987 conditions per place.). [2022-12-13 08:01:05,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 08:01:05,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 08:01:05,199 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:01:05,201 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:01:05,201 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:01:05,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:01:05 BasicIcfg [2022-12-13 08:01:05,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:01:05,204 INFO L158 Benchmark]: Toolchain (without parser) took 810438.16ms. Allocated memory was 179.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 154.7MB in the beginning and 515.4MB in the end (delta: -360.7MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 08:01:05,204 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:01:05,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.40ms. Allocated memory is still 179.3MB. Free memory was 154.1MB in the beginning and 140.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 08:01:05,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.60ms. Allocated memory is still 179.3MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:01:05,204 INFO L158 Benchmark]: Boogie Preprocessor took 34.77ms. Allocated memory is still 179.3MB. Free memory was 138.9MB in the beginning and 137.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:01:05,205 INFO L158 Benchmark]: RCFGBuilder took 595.34ms. Allocated memory is still 179.3MB. Free memory was 137.4MB in the beginning and 117.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 08:01:05,205 INFO L158 Benchmark]: TraceAbstraction took 809489.42ms. Allocated memory was 179.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 116.4MB in the beginning and 515.4MB in the end (delta: -399.0MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 08:01:05,206 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.40ms. Allocated memory is still 179.3MB. Free memory was 154.1MB in the beginning and 140.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.60ms. Allocated memory is still 179.3MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.77ms. Allocated memory is still 179.3MB. Free memory was 138.9MB in the beginning and 137.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 595.34ms. Allocated memory is still 179.3MB. Free memory was 137.4MB in the beginning and 117.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 809489.42ms. Allocated memory was 179.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 116.4MB in the beginning and 515.4MB in the end (delta: -399.0MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 117 PlacesBefore, 22 PlacesAfterwards, 121 TransitionsBefore, 19 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 33 ConcurrentYvCompositions, 7 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 768, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 683, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 683, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 778, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 683, unknown conditional: 0, unknown unconditional: 683] , Statistics on independence cache: Total cache size (in pairs): 1219, Positive cache size: 1211, Positive conditional cache size: 0, Positive unconditional cache size: 1211, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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, 24 PlacesBefore, 24 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 27 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.0s, 29 PlacesBefore, 28 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 6 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 30 TransitionsBefore, 30 TransitionsAfterwards, 2 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.9s, 46 PlacesBefore, 44 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 57 PlacesBefore, 57 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 60 PlacesBefore, 60 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 2.4s, 78 PlacesBefore, 77 PlacesAfterwards, 196 TransitionsBefore, 195 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 92 PlacesBefore, 92 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 124 PlacesBefore, 124 PlacesAfterwards, 520 TransitionsBefore, 520 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 133 PlacesBefore, 133 PlacesAfterwards, 610 TransitionsBefore, 610 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 167 PlacesBefore, 167 PlacesAfterwards, 1189 TransitionsBefore, 1189 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.1s, 236 PlacesBefore, 235 PlacesAfterwards, 2858 TransitionsBefore, 2857 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 274 PlacesBefore, 274 PlacesAfterwards, 3824 TransitionsBefore, 3824 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 311 PlacesBefore, 311 PlacesAfterwards, 3380 TransitionsBefore, 3380 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 367 PlacesBefore, 367 PlacesAfterwards, 4595 TransitionsBefore, 4595 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 412 PlacesBefore, 411 PlacesAfterwards, 6544 TransitionsBefore, 6543 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 459 PlacesBefore, 459 PlacesAfterwards, 8329 TransitionsBefore, 8329 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.5s, 513 PlacesBefore, 512 PlacesAfterwards, 11530 TransitionsBefore, 11529 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 514 PlacesBefore, 514 PlacesAfterwards, 12796 TransitionsBefore, 12796 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 566 PlacesBefore, 565 PlacesAfterwards, 17211 TransitionsBefore, 17210 TransitionsAfterwards, 0 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): 2, Positive cache size: 1, Positive conditional cache size: 0, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/24 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 481357 conditions, 21037 events (12312/21036 cut-off events. For 4448/4448 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 192044 event pairs, 0 based on Foata normal form. 28/18698 useless extension candidates. Maximal degree in co-relation 118916. Up to 20987 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/24 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 481357 conditions, 21037 events (12312/21036 cut-off events. For 4448/4448 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 192044 event pairs, 0 based on Foata normal form. 28/18698 useless extension candidates. Maximal degree in co-relation 118916. Up to 20987 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/24 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 481357 conditions, 21037 events (12312/21036 cut-off events. For 4448/4448 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 192044 event pairs, 0 based on Foata normal form. 28/18698 useless extension candidates. Maximal degree in co-relation 118916. Up to 20987 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 156 locations, 3 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: 809.4s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 712.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 4609 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4609 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 1274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14355 IncrementalHoareTripleChecker+Invalid, 15726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1274 mSolverCounterUnsat, 22 mSDtfsCounter, 14355 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 400 SyntacticMatches, 19 SemanticMatches, 895 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14565 ImplicationChecksByTransitivity, 44.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=755862occurred in iteration=21, InterpolantAutomatonStates: 724, 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.6s SatisfiabilityAnalysisTime, 46.5s InterpolantComputationTime, 779 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1064 ConstructedInterpolants, 7 QuantifiedInterpolants, 31199 SizeOfPredicates, 519 NumberOfNonLiveVariables, 3906 ConjunctsInSsa, 619 ConjunctsInUnsatCore, 59 InterpolantComputations, 4 PerfectInterpolantSequences, 102/526 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