/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:10:43,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:10:43,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:10:44,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:10:44,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:10:44,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:10:44,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:10:44,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:10:44,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:10:44,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:10:44,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:10:44,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:10:44,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:10:44,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:10:44,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:10:44,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:10:44,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:10:44,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:10:44,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:10:44,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:10:44,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:10:44,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:10:44,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:10:44,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:10:44,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:10:44,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:10:44,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:10:44,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:10:44,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:10:44,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:10:44,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:10:44,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:10:44,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:10:44,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:10:44,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:10:44,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:10:44,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:10:44,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:10:44,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:10:44,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:10:44,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:10:44,099 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-06 03:10:44,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:10:44,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:10:44,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:10:44,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:10:44,132 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:10:44,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:10:44,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:10:44,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:10:44,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:10:44,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:10:44,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:10:44,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:10:44,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:10:44,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:10:44,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:10:44,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:10:44,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:10:44,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:10:44,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:10:44,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:10:44,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:10:44,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:10:44,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:10:44,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:10:44,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:10:44,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:10:44,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:10:44,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:10:44,137 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 [2022-12-06 03:10:44,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:10:44,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:10:44,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:10:44,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:10:44,491 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:10:44,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-06 03:10:45,557 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:10:45,733 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:10:45,733 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-06 03:10:45,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5ab778e/e99f4e619d0a4e669c5e17d1da0eedad/FLAG553be4a07 [2022-12-06 03:10:45,759 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5ab778e/e99f4e619d0a4e669c5e17d1da0eedad [2022-12-06 03:10:45,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:10:45,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:10:45,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:10:45,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:10:45,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:10:45,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:10:45" (1/1) ... [2022-12-06 03:10:45,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8887ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:45, skipping insertion in model container [2022-12-06 03:10:45,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:10:45" (1/1) ... [2022-12-06 03:10:45,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:10:45,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:10:45,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:45,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:45,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:45,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:45,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:45,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:45,932 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-queue-add-2.wvr.c[2696,2709] [2022-12-06 03:10:45,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:10:45,952 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:10:45,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:45,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:45,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:45,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:45,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:45,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:45,989 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-queue-add-2.wvr.c[2696,2709] [2022-12-06 03:10:45,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:10:46,005 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:10:46,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46 WrapperNode [2022-12-06 03:10:46,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:10:46,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:10:46,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:10:46,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:10:46,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,061 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2022-12-06 03:10:46,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:10:46,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:10:46,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:10:46,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:10:46,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:10:46,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:10:46,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:10:46,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:10:46,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (1/1) ... [2022-12-06 03:10:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:10:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:46,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:10:46,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:10:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:10:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:10:46,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:10:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:10:46,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:10:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:10:46,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:10:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:10:46,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:10:46,171 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:10:46,281 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:10:46,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:10:46,560 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:10:46,657 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:10:46,658 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:10:46,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:10:46 BoogieIcfgContainer [2022-12-06 03:10:46,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:10:46,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:10:46,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:10:46,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:10:46,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:10:45" (1/3) ... [2022-12-06 03:10:46,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3f7e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:10:46, skipping insertion in model container [2022-12-06 03:10:46,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:46" (2/3) ... [2022-12-06 03:10:46,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3f7e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:10:46, skipping insertion in model container [2022-12-06 03:10:46,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:10:46" (3/3) ... [2022-12-06 03:10:46,675 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-12-06 03:10:46,692 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:10:46,692 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:10:46,692 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:10:46,776 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:10:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 264 flow [2022-12-06 03:10:46,901 INFO L130 PetriNetUnfolder]: 11/122 cut-off events. [2022-12-06 03:10:46,902 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:10:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 122 events. 11/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2022-12-06 03:10:46,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 264 flow [2022-12-06 03:10:46,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 114 transitions, 240 flow [2022-12-06 03:10:46,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:46,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-06 03:10:46,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 114 transitions, 240 flow [2022-12-06 03:10:46,988 INFO L130 PetriNetUnfolder]: 11/114 cut-off events. [2022-12-06 03:10:46,988 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:10:46,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 11/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2022-12-06 03:10:46,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-06 03:10:46,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-06 03:10:51,838 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 03:10:51,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:10:51,857 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;@11386918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:10:51,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:10:51,862 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:10:51,862 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:10:51,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:51,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:51,863 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-06 03:10:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash 82611840, now seen corresponding path program 1 times [2022-12-06 03:10:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968035577] [2022-12-06 03:10:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968035577] [2022-12-06 03:10:52,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968035577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:52,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:52,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:10:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078639584] [2022-12-06 03:10:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:52,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:52,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:52,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 03:10:52,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:52,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:52,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 03:10:52,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:52,412 INFO L130 PetriNetUnfolder]: 45/87 cut-off events. [2022-12-06 03:10:52,413 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 03:10:52,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 87 events. 45/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 190 event pairs, 18 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 03:10:52,415 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 14 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2022-12-06 03:10:52,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 106 flow [2022-12-06 03:10:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:10:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:10:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 03:10:52,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 03:10:52,431 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 03:10:52,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:52,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 23 transitions, 106 flow [2022-12-06 03:10:52,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 23 transitions, 106 flow [2022-12-06 03:10:52,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 30 [2022-12-06 03:10:54,118 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:54,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1689 [2022-12-06 03:10:54,120 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 102 flow [2022-12-06 03:10:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:54,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:54,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:54,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:10:54,121 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-06 03:10:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1970902732, now seen corresponding path program 1 times [2022-12-06 03:10:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791524616] [2022-12-06 03:10:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:54,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791524616] [2022-12-06 03:10:54,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791524616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:54,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:54,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:10:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496531800] [2022-12-06 03:10:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:54,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:10:54,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:10:54,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:10:54,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 03:10:54,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:54,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:54,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 03:10:54,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:54,614 INFO L130 PetriNetUnfolder]: 75/148 cut-off events. [2022-12-06 03:10:54,614 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 03:10:54,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 148 events. 75/148 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 451 event pairs, 15 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 302. Up to 124 conditions per place. [2022-12-06 03:10:54,617 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 31 selfloop transitions, 8 changer transitions 10/50 dead transitions. [2022-12-06 03:10:54,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 50 transitions, 331 flow [2022-12-06 03:10:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:10:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:10:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 03:10:54,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2022-12-06 03:10:54,622 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 03:10:54,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:54,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 50 transitions, 331 flow [2022-12-06 03:10:54,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 50 transitions, 331 flow [2022-12-06 03:10:54,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 03:10:54,628 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:54,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 03:10:54,631 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 50 transitions, 331 flow [2022-12-06 03:10:54,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:54,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:54,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:10:54,632 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-06 03:10:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1155837168, now seen corresponding path program 1 times [2022-12-06 03:10:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829117309] [2022-12-06 03:10:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:54,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:54,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829117309] [2022-12-06 03:10:54,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829117309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:54,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:54,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:10:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309530729] [2022-12-06 03:10:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:54,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:10:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:10:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:10:54,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 03:10:54,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 50 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:54,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:54,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 03:10:54,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:54,980 INFO L130 PetriNetUnfolder]: 114/233 cut-off events. [2022-12-06 03:10:54,980 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-06 03:10:54,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 233 events. 114/233 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 871 event pairs, 15 based on Foata normal form. 10/180 useless extension candidates. Maximal degree in co-relation 392. Up to 204 conditions per place. [2022-12-06 03:10:54,986 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 57 selfloop transitions, 5 changer transitions 28/93 dead transitions. [2022-12-06 03:10:54,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 93 transitions, 805 flow [2022-12-06 03:10:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:10:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:10:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 03:10:54,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 03:10:54,992 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-06 03:10:54,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:54,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 93 transitions, 805 flow [2022-12-06 03:10:54,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 93 transitions, 805 flow [2022-12-06 03:10:54,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 03:10:57,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:57,021 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2029 [2022-12-06 03:10:57,021 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 92 transitions, 797 flow [2022-12-06 03:10:57,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:57,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:57,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:57,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:10:57,021 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-06 03:10:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash -366932293, now seen corresponding path program 1 times [2022-12-06 03:10:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047650099] [2022-12-06 03:10:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:57,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047650099] [2022-12-06 03:10:57,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047650099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984072945] [2022-12-06 03:10:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:57,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:10:57,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:10:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:57,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:10:57,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:57,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:10:57,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984072945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:57,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:10:57,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 03:10:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391546199] [2022-12-06 03:10:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:57,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:10:57,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:10:57,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 92 transitions, 797 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:57,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:57,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:10:57,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:57,343 INFO L130 PetriNetUnfolder]: 92/198 cut-off events. [2022-12-06 03:10:57,344 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2022-12-06 03:10:57,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 198 events. 92/198 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 764 event pairs, 15 based on Foata normal form. 8/155 useless extension candidates. Maximal degree in co-relation 482. Up to 169 conditions per place. [2022-12-06 03:10:57,345 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 37 selfloop transitions, 0 changer transitions 40/80 dead transitions. [2022-12-06 03:10:57,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 80 transitions, 846 flow [2022-12-06 03:10:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:10:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:10:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 03:10:57,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2022-12-06 03:10:57,348 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 03:10:57,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:57,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 80 transitions, 846 flow [2022-12-06 03:10:57,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 80 transitions, 846 flow [2022-12-06 03:10:57,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-06 03:10:57,356 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:57,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:10:57,358 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 80 transitions, 846 flow [2022-12-06 03:10:57,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:57,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:57,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:57,366 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-06 03:10:57,566 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-06 03:10:57,566 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-06 03:10:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash -739675103, now seen corresponding path program 1 times [2022-12-06 03:10:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:57,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126096724] [2022-12-06 03:10:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126096724] [2022-12-06 03:10:58,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126096724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:58,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782843528] [2022-12-06 03:10:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:58,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:58,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:10:58,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:10:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:58,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 03:10:58,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:58,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:10:58,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:10:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:58,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:10:58,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782843528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:58,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:10:58,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-12-06 03:10:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754445146] [2022-12-06 03:10:58,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:58,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:10:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:10:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:10:58,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 03:10:58,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 80 transitions, 846 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:58,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:58,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 03:10:58,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:58,764 INFO L130 PetriNetUnfolder]: 111/229 cut-off events. [2022-12-06 03:10:58,764 INFO L131 PetriNetUnfolder]: For 221/223 co-relation queries the response was YES. [2022-12-06 03:10:58,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 229 events. 111/229 cut-off events. For 221/223 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 881 event pairs, 5 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 523. Up to 196 conditions per place. [2022-12-06 03:10:58,766 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 48 selfloop transitions, 9 changer transitions 38/96 dead transitions. [2022-12-06 03:10:58,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 96 transitions, 1202 flow [2022-12-06 03:10:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:10:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:10:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 03:10:58,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 03:10:58,770 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 03:10:58,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:58,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 96 transitions, 1202 flow [2022-12-06 03:10:58,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 96 transitions, 1202 flow [2022-12-06 03:10:58,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 03:11:01,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:11:01,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2454 [2022-12-06 03:11:01,224 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 95 transitions, 1190 flow [2022-12-06 03:11:01,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:01,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:01,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:01,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:01,425 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-06 03:11:01,425 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-06 03:11:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1274636333, now seen corresponding path program 1 times [2022-12-06 03:11:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:01,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335436929] [2022-12-06 03:11:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335436929] [2022-12-06 03:11:01,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335436929] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182354258] [2022-12-06 03:11:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:01,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:01,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:01,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:11:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:02,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 03:11:02,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:02,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:02,132 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 03:11:02,132 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 25 treesize of output 16 [2022-12-06 03:11:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:02,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182354258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:02,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:02,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 03:11:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575145243] [2022-12-06 03:11:02,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:02,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:11:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:02,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:11:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:11:02,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 03:11:02,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 95 transitions, 1190 flow. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:02,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:02,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 03:11:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:02,836 INFO L130 PetriNetUnfolder]: 282/580 cut-off events. [2022-12-06 03:11:02,837 INFO L131 PetriNetUnfolder]: For 413/415 co-relation queries the response was YES. [2022-12-06 03:11:02,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 580 events. 282/580 cut-off events. For 413/415 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2924 event pairs, 4 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 1883. Up to 542 conditions per place. [2022-12-06 03:11:02,842 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 140 selfloop transitions, 62 changer transitions 47/253 dead transitions. [2022-12-06 03:11:02,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 253 transitions, 3692 flow [2022-12-06 03:11:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:11:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:11:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 148 transitions. [2022-12-06 03:11:02,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2022-12-06 03:11:02,848 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 03:11:02,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:02,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 253 transitions, 3692 flow [2022-12-06 03:11:02,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 253 transitions, 3692 flow [2022-12-06 03:11:02,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 03:11:02,859 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:02,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 03:11:02,882 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 253 transitions, 3692 flow [2022-12-06 03:11:02,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:02,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:02,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:02,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:03,088 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-06 03:11:03,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:11:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1939231432, now seen corresponding path program 1 times [2022-12-06 03:11:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:03,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110504560] [2022-12-06 03:11:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:03,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:03,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110504560] [2022-12-06 03:11:03,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110504560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:03,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236676293] [2022-12-06 03:11:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:03,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:03,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:11:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:03,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:11:03,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:03,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:11:03,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236676293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:03,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:11:03,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 03:11:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273848171] [2022-12-06 03:11:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:03,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:11:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:03,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:11:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:11:03,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 03:11:03,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 253 transitions, 3692 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:03,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:03,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 03:11:03,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:03,567 INFO L130 PetriNetUnfolder]: 330/696 cut-off events. [2022-12-06 03:11:03,567 INFO L131 PetriNetUnfolder]: For 629/631 co-relation queries the response was YES. [2022-12-06 03:11:03,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5549 conditions, 696 events. 330/696 cut-off events. For 629/631 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3697 event pairs, 5 based on Foata normal form. 18/526 useless extension candidates. Maximal degree in co-relation 2690. Up to 663 conditions per place. [2022-12-06 03:11:03,574 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 208 selfloop transitions, 50 changer transitions 66/327 dead transitions. [2022-12-06 03:11:03,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 327 transitions, 5423 flow [2022-12-06 03:11:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:11:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:11:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 03:11:03,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 03:11:03,576 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 03:11:03,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:03,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 327 transitions, 5423 flow [2022-12-06 03:11:03,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 327 transitions, 5423 flow [2022-12-06 03:11:03,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 03:11:03,588 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:03,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:11:03,589 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 327 transitions, 5423 flow [2022-12-06 03:11:03,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:03,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:03,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:03,598 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-06 03:11:03,795 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-06 03:11:03,796 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-06 03:11:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 537877725, now seen corresponding path program 2 times [2022-12-06 03:11:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:03,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692655198] [2022-12-06 03:11:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692655198] [2022-12-06 03:11:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692655198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464827410] [2022-12-06 03:11:04,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:11:04,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:04,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:04,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:04,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:11:04,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:04,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:04,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:11:04,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:04,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:04,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:04,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:04,499 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-12-06 03:11:04,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:04,516 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 45 treesize of output 41 [2022-12-06 03:11:04,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 03:11:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 03:11:04,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464827410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:04,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:04,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 03:11:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336029136] [2022-12-06 03:11:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:04,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:11:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:11:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2022-12-06 03:11:04,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:04,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 327 transitions, 5423 flow. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:04,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:04,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:04,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:05,027 INFO L130 PetriNetUnfolder]: 313/655 cut-off events. [2022-12-06 03:11:05,027 INFO L131 PetriNetUnfolder]: For 558/558 co-relation queries the response was YES. [2022-12-06 03:11:05,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 655 events. 313/655 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3398 event pairs, 4 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 2638. Up to 623 conditions per place. [2022-12-06 03:11:05,036 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 223 selfloop transitions, 17 changer transitions 66/307 dead transitions. [2022-12-06 03:11:05,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 307 transitions, 5706 flow [2022-12-06 03:11:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:11:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:11:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-06 03:11:05,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2022-12-06 03:11:05,039 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 43 predicate places. [2022-12-06 03:11:05,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:05,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 307 transitions, 5706 flow [2022-12-06 03:11:05,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 307 transitions, 5706 flow [2022-12-06 03:11:05,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 03:11:05,051 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:05,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:11:05,052 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 307 transitions, 5706 flow [2022-12-06 03:11:05,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:05,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:05,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:05,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:05,258 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-06 03:11:05,259 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-06 03:11:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1857946759, now seen corresponding path program 1 times [2022-12-06 03:11:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:05,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480076244] [2022-12-06 03:11:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:05,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480076244] [2022-12-06 03:11:05,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480076244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:05,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881625420] [2022-12-06 03:11:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:05,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:05,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:11:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:05,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 03:11:05,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:06,088 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 25 treesize of output 7 [2022-12-06 03:11:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:06,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:06,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:06,230 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 53 treesize of output 33 [2022-12-06 03:11:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:06,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881625420] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:06,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:06,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 03:11:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55766010] [2022-12-06 03:11:06,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:06,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:11:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:06,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:11:06,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:11:06,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:06,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 307 transitions, 5706 flow. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:06,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:06,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:06,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:07,603 INFO L130 PetriNetUnfolder]: 464/969 cut-off events. [2022-12-06 03:11:07,603 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2022-12-06 03:11:07,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9656 conditions, 969 events. 464/969 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5625 event pairs, 6 based on Foata normal form. 4/729 useless extension candidates. Maximal degree in co-relation 4533. Up to 930 conditions per place. [2022-12-06 03:11:07,613 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 280 selfloop transitions, 73 changer transitions 105/459 dead transitions. [2022-12-06 03:11:07,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 459 transitions, 9481 flow [2022-12-06 03:11:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:11:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:11:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 160 transitions. [2022-12-06 03:11:07,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 03:11:07,616 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 64 predicate places. [2022-12-06 03:11:07,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:07,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 459 transitions, 9481 flow [2022-12-06 03:11:07,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 459 transitions, 9481 flow [2022-12-06 03:11:07,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 03:11:07,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:07,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 03:11:07,633 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 459 transitions, 9481 flow [2022-12-06 03:11:07,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:07,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:07,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:07,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:07,846 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-06 03:11:07,846 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-06 03:11:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1114702083, now seen corresponding path program 2 times [2022-12-06 03:11:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097527666] [2022-12-06 03:11:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:08,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097527666] [2022-12-06 03:11:08,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097527666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:08,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471542325] [2022-12-06 03:11:08,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:11:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:08,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:08,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:11:08,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:08,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:08,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 03:11:08,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:08,564 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-06 03:11:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:08,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:08,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:08,733 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 42 treesize of output 30 [2022-12-06 03:11:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471542325] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:08,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:08,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 03:11:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693133139] [2022-12-06 03:11:08,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:11:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:11:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:11:08,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:08,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 459 transitions, 9481 flow. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:08,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:08,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:08,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:10,772 INFO L130 PetriNetUnfolder]: 606/1277 cut-off events. [2022-12-06 03:11:10,773 INFO L131 PetriNetUnfolder]: For 1054/1054 co-relation queries the response was YES. [2022-12-06 03:11:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14057 conditions, 1277 events. 606/1277 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8041 event pairs, 4 based on Foata normal form. 10/961 useless extension candidates. Maximal degree in co-relation 6805. Up to 1239 conditions per place. [2022-12-06 03:11:10,787 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 344 selfloop transitions, 102 changer transitions 174/621 dead transitions. [2022-12-06 03:11:10,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 621 transitions, 14087 flow [2022-12-06 03:11:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 03:11:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 03:11:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 205 transitions. [2022-12-06 03:11:10,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35344827586206895 [2022-12-06 03:11:10,791 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 03:11:10,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:10,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 621 transitions, 14087 flow [2022-12-06 03:11:10,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 621 transitions, 14087 flow [2022-12-06 03:11:10,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 03:11:10,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:10,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 03:11:10,815 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 621 transitions, 14087 flow [2022-12-06 03:11:10,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:10,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:10,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:10,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 03:11:11,024 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-06 03:11:11,024 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-06 03:11:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -507372317, now seen corresponding path program 3 times [2022-12-06 03:11:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:11,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63651691] [2022-12-06 03:11:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:11,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63651691] [2022-12-06 03:11:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63651691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666070088] [2022-12-06 03:11:11,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:11:11,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:11,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:11,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:11,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:11:11,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:11:11,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:11,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 03:11:11,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:11,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:11,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:11,942 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 25 treesize of output 7 [2022-12-06 03:11:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:11,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:12,022 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_340 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) c_~q~0.base) .cse0)))) (forall ((v_ArrVal_340 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) c_~q~0.base) .cse0)) c_~N~0)))) is different from false [2022-12-06 03:11:12,039 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (let ((.cse0 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_340 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) c_~q~0.base) .cse0)))) (forall ((v_ArrVal_340 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) c_~q~0.base) .cse0)) c_~N~0))))) is different from false [2022-12-06 03:11:12,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:12,061 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 82 treesize of output 70 [2022-12-06 03:11:12,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-12-06 03:11:12,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-12-06 03:11:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 03:11:12,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666070088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:12,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:12,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 03:11:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122278853] [2022-12-06 03:11:12,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:11:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:11:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2022-12-06 03:11:12,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:12,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 621 transitions, 14087 flow. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:12,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:12,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:15,537 INFO L130 PetriNetUnfolder]: 759/1640 cut-off events. [2022-12-06 03:11:15,538 INFO L131 PetriNetUnfolder]: For 1880/1880 co-relation queries the response was YES. [2022-12-06 03:11:15,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19635 conditions, 1640 events. 759/1640 cut-off events. For 1880/1880 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11263 event pairs, 12 based on Foata normal form. 6/1247 useless extension candidates. Maximal degree in co-relation 9797. Up to 1591 conditions per place. [2022-12-06 03:11:15,556 INFO L137 encePairwiseOnDemand]: 4/20 looper letters, 445 selfloop transitions, 168 changer transitions 200/814 dead transitions. [2022-12-06 03:11:15,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 814 transitions, 20151 flow [2022-12-06 03:11:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:11:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:11:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-12-06 03:11:15,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2022-12-06 03:11:15,559 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 110 predicate places. [2022-12-06 03:11:15,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:15,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 814 transitions, 20151 flow [2022-12-06 03:11:15,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 814 transitions, 20151 flow [2022-12-06 03:11:15,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 03:11:15,591 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:15,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 03:11:15,593 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 814 transitions, 20151 flow [2022-12-06 03:11:15,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:15,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:15,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:15,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:15,798 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-06 03:11:15,799 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-06 03:11:15,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash 919749845, now seen corresponding path program 4 times [2022-12-06 03:11:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:15,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104207269] [2022-12-06 03:11:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:15,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:16,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:16,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104207269] [2022-12-06 03:11:16,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104207269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:16,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783222067] [2022-12-06 03:11:16,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:11:16,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:16,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:16,380 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:16,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:11:16,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:11:16,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:16,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 03:11:16,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:16,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:16,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:16,684 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-06 03:11:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:16,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:16,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:16,947 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 82 treesize of output 70 [2022-12-06 03:11:16,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-12-06 03:11:16,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-12-06 03:11:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:17,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783222067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:17,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:17,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 03:11:17,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474137330] [2022-12-06 03:11:17,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:17,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:11:17,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:11:17,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=268, Unknown=3, NotChecked=0, Total=342 [2022-12-06 03:11:17,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:17,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 814 transitions, 20151 flow. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-06 03:11:17,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:17,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:17,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:22,417 INFO L130 PetriNetUnfolder]: 940/2056 cut-off events. [2022-12-06 03:11:22,417 INFO L131 PetriNetUnfolder]: For 2363/2363 co-relation queries the response was YES. [2022-12-06 03:11:22,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26701 conditions, 2056 events. 940/2056 cut-off events. For 2363/2363 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15072 event pairs, 16 based on Foata normal form. 8/1551 useless extension candidates. Maximal degree in co-relation 13403. Up to 2005 conditions per place. [2022-12-06 03:11:22,440 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 562 selfloop transitions, 193 changer transitions 295/1051 dead transitions. [2022-12-06 03:11:22,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 1051 transitions, 28128 flow [2022-12-06 03:11:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 03:11:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 03:11:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 209 transitions. [2022-12-06 03:11:22,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34833333333333333 [2022-12-06 03:11:22,442 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 139 predicate places. [2022-12-06 03:11:22,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:22,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 1051 transitions, 28128 flow [2022-12-06 03:11:22,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 1051 transitions, 28128 flow [2022-12-06 03:11:22,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 03:11:22,499 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:22,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 03:11:22,499 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 1051 transitions, 28128 flow [2022-12-06 03:11:22,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-06 03:11:22,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:22,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:22,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:22,705 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-06 03:11:22,705 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-06 03:11:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1542643063, now seen corresponding path program 1 times [2022-12-06 03:11:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:22,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181995749] [2022-12-06 03:11:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:23,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181995749] [2022-12-06 03:11:23,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181995749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:23,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35827041] [2022-12-06 03:11:23,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:23,296 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:23,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:11:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:23,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:11:23,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:23,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:23,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:23,502 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-12-06 03:11:23,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:23,515 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 45 treesize of output 41 [2022-12-06 03:11:23,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 03:11:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 03:11:23,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35827041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:23,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:23,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-06 03:11:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050910514] [2022-12-06 03:11:23,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:23,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:11:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:11:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2022-12-06 03:11:23,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:23,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 1051 transitions, 28128 flow. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:23,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:23,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:23,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:24,534 INFO L130 PetriNetUnfolder]: 968/2090 cut-off events. [2022-12-06 03:11:24,534 INFO L131 PetriNetUnfolder]: For 2665/2665 co-relation queries the response was YES. [2022-12-06 03:11:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29201 conditions, 2090 events. 968/2090 cut-off events. For 2665/2665 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15113 event pairs, 8 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 14429. Up to 2035 conditions per place. [2022-12-06 03:11:24,552 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 722 selfloop transitions, 57 changer transitions 291/1071 dead transitions. [2022-12-06 03:11:24,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1071 transitions, 30793 flow [2022-12-06 03:11:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:11:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:11:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-12-06 03:11:24,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-06 03:11:24,553 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 146 predicate places. [2022-12-06 03:11:24,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:24,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 1071 transitions, 30793 flow [2022-12-06 03:11:24,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 1071 transitions, 30793 flow [2022-12-06 03:11:24,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 03:11:24,591 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:24,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 03:11:24,592 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 1071 transitions, 30793 flow [2022-12-06 03:11:24,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:24,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:24,593 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:24,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:24,797 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-06 03:11:24,797 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-06 03:11:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1075712889, now seen corresponding path program 5 times [2022-12-06 03:11:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:24,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757612427] [2022-12-06 03:11:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:24,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757612427] [2022-12-06 03:11:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757612427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618334031] [2022-12-06 03:11:24,918 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:11:24,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:24,920 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:24,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:11:25,012 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:25,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:25,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 03:11:25,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:25,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:25,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618334031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:25,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:25,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 13 [2022-12-06 03:11:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641084633] [2022-12-06 03:11:25,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:25,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:11:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:11:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:11:25,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 03:11:25,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 1071 transitions, 30793 flow. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:25,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:25,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 03:11:25,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:26,058 INFO L130 PetriNetUnfolder]: 846/1930 cut-off events. [2022-12-06 03:11:26,059 INFO L131 PetriNetUnfolder]: For 3454/3454 co-relation queries the response was YES. [2022-12-06 03:11:26,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28773 conditions, 1930 events. 846/1930 cut-off events. For 3454/3454 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14545 event pairs, 0 based on Foata normal form. 142/1632 useless extension candidates. Maximal degree in co-relation 13291. Up to 1871 conditions per place. [2022-12-06 03:11:26,071 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 347 selfloop transitions, 81 changer transitions 607/1039 dead transitions. [2022-12-06 03:11:26,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1039 transitions, 31931 flow [2022-12-06 03:11:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:11:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:11:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-12-06 03:11:26,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2022-12-06 03:11:26,072 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 156 predicate places. [2022-12-06 03:11:26,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:26,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 1039 transitions, 31931 flow [2022-12-06 03:11:26,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 1039 transitions, 31931 flow [2022-12-06 03:11:26,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-06 03:11:26,105 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:26,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 03:11:26,105 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 1039 transitions, 31931 flow [2022-12-06 03:11:26,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:26,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:26,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:26,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:26,310 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-06 03:11:26,310 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-06 03:11:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1195811905, now seen corresponding path program 1 times [2022-12-06 03:11:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:26,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197995627] [2022-12-06 03:11:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:27,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197995627] [2022-12-06 03:11:27,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197995627] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960047172] [2022-12-06 03:11:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:27,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:27,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:11:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:27,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 03:11:27,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:27,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:27,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:27,349 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 25 treesize of output 7 [2022-12-06 03:11:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:27,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:27,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:27,581 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 144 treesize of output 116 [2022-12-06 03:11:27,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 87 [2022-12-06 03:11:27,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2022-12-06 03:11:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:27,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960047172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:27,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:27,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 03:11:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637782698] [2022-12-06 03:11:27,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:27,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:11:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:11:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=443, Unknown=1, NotChecked=0, Total=506 [2022-12-06 03:11:27,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:27,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 1039 transitions, 31931 flow. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:27,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:27,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:29,207 INFO L130 PetriNetUnfolder]: 863/1978 cut-off events. [2022-12-06 03:11:29,207 INFO L131 PetriNetUnfolder]: For 3844/3844 co-relation queries the response was YES. [2022-12-06 03:11:29,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31450 conditions, 1978 events. 863/1978 cut-off events. For 3844/3844 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15013 event pairs, 0 based on Foata normal form. 2/1528 useless extension candidates. Maximal degree in co-relation 14173. Up to 1919 conditions per place. [2022-12-06 03:11:29,220 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 399 selfloop transitions, 22 changer transitions 653/1075 dead transitions. [2022-12-06 03:11:29,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 1075 transitions, 35195 flow [2022-12-06 03:11:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 03:11:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 03:11:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-12-06 03:11:29,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.340625 [2022-12-06 03:11:29,222 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 171 predicate places. [2022-12-06 03:11:29,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:29,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 1075 transitions, 35195 flow [2022-12-06 03:11:29,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 1075 transitions, 35195 flow [2022-12-06 03:11:29,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 03:11:29,258 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:29,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 03:11:29,258 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 1075 transitions, 35195 flow [2022-12-06 03:11:29,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:29,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:29,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:29,267 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-06 03:11:29,464 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-06 03:11:29,464 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-06 03:11:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2042469791, now seen corresponding path program 2 times [2022-12-06 03:11:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:29,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947993515] [2022-12-06 03:11:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:30,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947993515] [2022-12-06 03:11:30,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947993515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407037705] [2022-12-06 03:11:30,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:11:30,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:30,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:30,154 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:30,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:11:30,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:30,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:30,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 03:11:30,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:30,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:30,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:30,431 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-06 03:11:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:30,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:30,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:30,673 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 140 treesize of output 112 [2022-12-06 03:11:30,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2022-12-06 03:11:30,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2022-12-06 03:11:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:30,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407037705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:30,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:30,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 03:11:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537138099] [2022-12-06 03:11:30,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:30,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 03:11:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:30,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 03:11:30,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=403, Unknown=2, NotChecked=0, Total=462 [2022-12-06 03:11:30,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:30,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1075 transitions, 35195 flow. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:30,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:30,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:30,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:34,130 INFO L130 PetriNetUnfolder]: 871/2003 cut-off events. [2022-12-06 03:11:34,130 INFO L131 PetriNetUnfolder]: For 4499/4499 co-relation queries the response was YES. [2022-12-06 03:11:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33794 conditions, 2003 events. 871/2003 cut-off events. For 4499/4499 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 15305 event pairs, 0 based on Foata normal form. 1/1546 useless extension candidates. Maximal degree in co-relation 15055. Up to 1942 conditions per place. [2022-12-06 03:11:34,140 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 397 selfloop transitions, 26 changer transitions 666/1090 dead transitions. [2022-12-06 03:11:34,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1090 transitions, 37865 flow [2022-12-06 03:11:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:11:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:11:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2022-12-06 03:11:34,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 03:11:34,142 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 184 predicate places. [2022-12-06 03:11:34,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:34,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 1090 transitions, 37865 flow [2022-12-06 03:11:34,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 1090 transitions, 37865 flow [2022-12-06 03:11:34,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 03:11:34,172 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:34,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 03:11:34,173 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 1090 transitions, 37865 flow [2022-12-06 03:11:34,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:34,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:34,173 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:34,180 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-06 03:11:34,378 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-06 03:11:34,378 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-06 03:11:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1437294361, now seen corresponding path program 6 times [2022-12-06 03:11:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:34,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660322014] [2022-12-06 03:11:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:11:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:34,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660322014] [2022-12-06 03:11:34,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660322014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:34,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634415440] [2022-12-06 03:11:34,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:11:34,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:34,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:34,469 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:34,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:11:34,571 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:11:34,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:34,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:11:34,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:34,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634415440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:34,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:34,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-06 03:11:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557840461] [2022-12-06 03:11:34,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:34,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:11:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:11:34,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:11:34,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 03:11:34,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1090 transitions, 37865 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:34,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:34,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 03:11:34,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:35,237 INFO L130 PetriNetUnfolder]: 384/894 cut-off events. [2022-12-06 03:11:35,238 INFO L131 PetriNetUnfolder]: For 3019/3019 co-relation queries the response was YES. [2022-12-06 03:11:35,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15820 conditions, 894 events. 384/894 cut-off events. For 3019/3019 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5596 event pairs, 0 based on Foata normal form. 40/730 useless extension candidates. Maximal degree in co-relation 4669. Up to 847 conditions per place. [2022-12-06 03:11:35,242 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 145 selfloop transitions, 0 changer transitions 319/467 dead transitions. [2022-12-06 03:11:35,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 467 transitions, 17117 flow [2022-12-06 03:11:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:11:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:11:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 03:11:35,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:11:35,244 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-06 03:11:35,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:35,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 467 transitions, 17117 flow [2022-12-06 03:11:35,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 467 transitions, 17117 flow [2022-12-06 03:11:35,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 03:11:35,258 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:35,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 03:11:35,258 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 467 transitions, 17117 flow [2022-12-06 03:11:35,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:35,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:35,258 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:35,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:35,466 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-06 03:11:35,466 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-06 03:11:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1843617364, now seen corresponding path program 3 times [2022-12-06 03:11:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:35,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133312906] [2022-12-06 03:11:35,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:35,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133312906] [2022-12-06 03:11:35,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133312906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:35,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758328935] [2022-12-06 03:11:35,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:11:35,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:35,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:35,864 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:35,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:11:36,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:11:36,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:36,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 03:11:36,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:36,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:36,378 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 03:11:36,379 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 26 treesize of output 18 [2022-12-06 03:11:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:36,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758328935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:36,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:36,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-06 03:11:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244563713] [2022-12-06 03:11:36,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:36,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:11:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:36,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:11:36,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:11:36,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 03:11:36,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 467 transitions, 17117 flow. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:36,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:36,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 03:11:36,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:39,871 INFO L130 PetriNetUnfolder]: 900/1874 cut-off events. [2022-12-06 03:11:39,872 INFO L131 PetriNetUnfolder]: For 3962/3962 co-relation queries the response was YES. [2022-12-06 03:11:39,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35332 conditions, 1874 events. 900/1874 cut-off events. For 3962/3962 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12139 event pairs, 2 based on Foata normal form. 16/1446 useless extension candidates. Maximal degree in co-relation 15143. Up to 1822 conditions per place. [2022-12-06 03:11:39,883 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 326 selfloop transitions, 190 changer transitions 361/878 dead transitions. [2022-12-06 03:11:39,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 878 transitions, 33850 flow [2022-12-06 03:11:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-06 03:11:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-06 03:11:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 422 transitions. [2022-12-06 03:11:39,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36379310344827587 [2022-12-06 03:11:39,886 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2022-12-06 03:11:39,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:39,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 878 transitions, 33850 flow [2022-12-06 03:11:39,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 878 transitions, 33850 flow [2022-12-06 03:11:39,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 03:11:42,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 03:11:42,758 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:11:42,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2873 [2022-12-06 03:11:42,759 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 876 transitions, 33776 flow [2022-12-06 03:11:42,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:42,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:42,759 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:42,764 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-06 03:11:42,963 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-06 03:11:42,963 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-06 03:11:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash 961799048, now seen corresponding path program 1 times [2022-12-06 03:11:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:42,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501149324] [2022-12-06 03:11:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:43,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501149324] [2022-12-06 03:11:43,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501149324] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749949891] [2022-12-06 03:11:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:43,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:43,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:43,320 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-06 03:11:43,322 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-06 03:11:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:43,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 03:11:43,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:43,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:43,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:11:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:43,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:43,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_637 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_637) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4))))) is different from false [2022-12-06 03:11:43,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:43,799 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 47 treesize of output 44 [2022-12-06 03:11:43,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-12-06 03:11:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:43,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749949891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:43,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:43,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-12-06 03:11:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054192411] [2022-12-06 03:11:43,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:43,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 03:11:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:43,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 03:11:43,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-12-06 03:11:43,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 03:11:43,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 876 transitions, 33776 flow. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:43,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:43,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 03:11:43,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:46,843 INFO L130 PetriNetUnfolder]: 2051/4040 cut-off events. [2022-12-06 03:11:46,844 INFO L131 PetriNetUnfolder]: For 4289/4289 co-relation queries the response was YES. [2022-12-06 03:11:46,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80734 conditions, 4040 events. 2051/4040 cut-off events. For 4289/4289 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 28276 event pairs, 0 based on Foata normal form. 0/3088 useless extension candidates. Maximal degree in co-relation 45838. Up to 3990 conditions per place. [2022-12-06 03:11:46,872 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 944 selfloop transitions, 470 changer transitions 369/1784 dead transitions. [2022-12-06 03:11:46,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1784 transitions, 72290 flow [2022-12-06 03:11:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 03:11:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 03:11:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 263 transitions. [2022-12-06 03:11:46,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3622589531680441 [2022-12-06 03:11:46,877 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 247 predicate places. [2022-12-06 03:11:46,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:46,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 1784 transitions, 72290 flow [2022-12-06 03:11:46,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 1784 transitions, 72290 flow [2022-12-06 03:11:46,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 03:11:46,936 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:46,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 03:11:46,937 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1784 transitions, 72290 flow [2022-12-06 03:11:46,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:46,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:46,937 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:46,942 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-06 03:11:47,138 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-06 03:11:47,138 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-06 03:11:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1748291530, now seen corresponding path program 2 times [2022-12-06 03:11:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:47,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438319758] [2022-12-06 03:11:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:47,929 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-06 03:11:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:47,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438319758] [2022-12-06 03:11:47,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438319758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:47,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116926942] [2022-12-06 03:11:47,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:11:47,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:47,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:47,931 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-06 03:11:47,934 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-06 03:11:48,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:48,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:48,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 03:11:48,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:48,362 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-06 03:11:48,362 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 45 treesize of output 26 [2022-12-06 03:11:48,470 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-06 03:11:48,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:48,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:48,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 162 [2022-12-06 03:11:49,606 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-06 03:11:49,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116926942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:49,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:49,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 03:11:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931956734] [2022-12-06 03:11:49,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:49,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 03:11:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 03:11:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-12-06 03:11:49,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 03:11:49,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1784 transitions, 72290 flow. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:49,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:49,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 03:11:49,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:54,964 INFO L130 PetriNetUnfolder]: 2531/5029 cut-off events. [2022-12-06 03:11:54,965 INFO L131 PetriNetUnfolder]: For 5588/5588 co-relation queries the response was YES. [2022-12-06 03:11:54,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105566 conditions, 5029 events. 2531/5029 cut-off events. For 5588/5588 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37420 event pairs, 0 based on Foata normal form. 13/3856 useless extension candidates. Maximal degree in co-relation 61690. Up to 4975 conditions per place. [2022-12-06 03:11:55,012 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 1603 selfloop transitions, 177 changer transitions 488/2269 dead transitions. [2022-12-06 03:11:55,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 2269 transitions, 96532 flow [2022-12-06 03:11:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 03:11:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 03:11:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 205 transitions. [2022-12-06 03:11:55,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3451178451178451 [2022-12-06 03:11:55,014 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 273 predicate places. [2022-12-06 03:11:55,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:55,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 2269 transitions, 96532 flow [2022-12-06 03:11:55,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 2269 transitions, 96532 flow [2022-12-06 03:11:55,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 03:11:55,093 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:55,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 03:11:55,094 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 2269 transitions, 96532 flow [2022-12-06 03:11:55,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:55,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:55,094 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:55,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 03:11:55,299 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-06 03:11:55,299 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-06 03:11:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -980927290, now seen corresponding path program 3 times [2022-12-06 03:11:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773346230] [2022-12-06 03:11:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:56,051 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-06 03:11:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:56,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773346230] [2022-12-06 03:11:56,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773346230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:56,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297179795] [2022-12-06 03:11:56,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:11:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:56,053 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-06 03:11:56,055 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-06 03:11:56,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:11:56,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:56,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 03:11:56,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:56,184 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 24 treesize of output 32 [2022-12-06 03:11:56,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:11:56,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:11:56,584 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-06 03:11:56,584 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 46 treesize of output 15 [2022-12-06 03:11:56,618 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-06 03:11:56,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:57,227 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-06 03:11:57,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297179795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:57,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:57,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 03:11:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636207072] [2022-12-06 03:11:57,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:57,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 03:11:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:57,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 03:11:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=505, Unknown=2, NotChecked=0, Total=600 [2022-12-06 03:11:57,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 03:11:57,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 2269 transitions, 96532 flow. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:57,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:57,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 03:11:57,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:04,227 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 84 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:10,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:12,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:15,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:23,908 WARN L233 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 104 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:25,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:28,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:30,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:36,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:38,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:41,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:49,835 WARN L233 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 97 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:51,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:54,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:56,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:58,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:13:05,364 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 94 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:07,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:13:15,893 WARN L233 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 100 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:18,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:13:20,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:13:24,401 INFO L130 PetriNetUnfolder]: 2934/5826 cut-off events. [2022-12-06 03:13:24,402 INFO L131 PetriNetUnfolder]: For 5961/5961 co-relation queries the response was YES. [2022-12-06 03:13:24,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128220 conditions, 5826 events. 2934/5826 cut-off events. For 5961/5961 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 45020 event pairs, 0 based on Foata normal form. 12/4465 useless extension candidates. Maximal degree in co-relation 76184. Up to 5773 conditions per place. [2022-12-06 03:13:24,445 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 1859 selfloop transitions, 231 changer transitions 579/2670 dead transitions. [2022-12-06 03:13:24,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 2670 transitions, 118946 flow [2022-12-06 03:13:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 03:13:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 03:13:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 246 transitions. [2022-12-06 03:13:24,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2022-12-06 03:13:24,448 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 308 predicate places. [2022-12-06 03:13:24,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:24,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 2670 transitions, 118946 flow [2022-12-06 03:13:24,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 2670 transitions, 118946 flow [2022-12-06 03:13:24,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 03:13:24,533 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:24,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 03:13:24,534 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 2670 transitions, 118946 flow [2022-12-06 03:13:24,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:24,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:24,534 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:24,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:13:24,739 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-06 03:13:24,740 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-06 03:13:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 487457012, now seen corresponding path program 4 times [2022-12-06 03:13:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:24,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917323750] [2022-12-06 03:13:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:25,671 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-06 03:13:25,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917323750] [2022-12-06 03:13:25,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917323750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489239672] [2022-12-06 03:13:25,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:13:25,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:25,673 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-06 03:13:25,679 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-06 03:13:25,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:13:25,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:13:25,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 03:13:25,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:26,098 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-06 03:13:26,098 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 46 treesize of output 24 [2022-12-06 03:13:26,223 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-06 03:13:26,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:26,531 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 03:13:26,532 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 76 treesize of output 78 [2022-12-06 03:13:26,729 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-06 03:13:26,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489239672] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:26,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:26,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-12-06 03:13:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781517526] [2022-12-06 03:13:26,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:26,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 03:13:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 03:13:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-12-06 03:13:26,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 03:13:26,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 2670 transitions, 118946 flow. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:26,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:26,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 03:13:26,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:39,055 INFO L130 PetriNetUnfolder]: 3822/7878 cut-off events. [2022-12-06 03:13:39,055 INFO L131 PetriNetUnfolder]: For 6314/6314 co-relation queries the response was YES. [2022-12-06 03:13:39,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181484 conditions, 7878 events. 3822/7878 cut-off events. For 6314/6314 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 66833 event pairs, 0 based on Foata normal form. 45/6198 useless extension candidates. Maximal degree in co-relation 112926. Up to 7827 conditions per place. [2022-12-06 03:13:39,112 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 1877 selfloop transitions, 1073 changer transitions 939/3890 dead transitions. [2022-12-06 03:13:39,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 3890 transitions, 181067 flow [2022-12-06 03:13:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 03:13:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 03:13:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 257 transitions. [2022-12-06 03:13:39,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3244949494949495 [2022-12-06 03:13:39,114 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 339 predicate places. [2022-12-06 03:13:39,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:39,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 360 places, 3890 transitions, 181067 flow [2022-12-06 03:13:39,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 360 places, 3890 transitions, 181067 flow [2022-12-06 03:13:39,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 03:13:39,328 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:39,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 03:13:39,329 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 3890 transitions, 181067 flow [2022-12-06 03:13:39,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:39,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:39,329 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:39,334 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-06 03:13:39,529 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-06 03:13:39,529 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:13:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash -32832174, now seen corresponding path program 5 times [2022-12-06 03:13:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:39,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889329426] [2022-12-06 03:13:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:40,189 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-06 03:13:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889329426] [2022-12-06 03:13:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889329426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003960653] [2022-12-06 03:13:40,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:13:40,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:40,192 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:40,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:13:40,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:13:40,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:13:40,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 03:13:40,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:40,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:40,560 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 48 treesize of output 12 [2022-12-06 03:13:40,630 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-06 03:13:40,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:40,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:40,935 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 100 treesize of output 84 [2022-12-06 03:13:41,126 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-06 03:13:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003960653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:41,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:41,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 03:13:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826118065] [2022-12-06 03:13:41,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:41,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:13:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:13:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:13:41,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 03:13:41,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 3890 transitions, 181067 flow. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:41,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:41,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 03:13:41,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:06,378 INFO L130 PetriNetUnfolder]: 5524/11177 cut-off events. [2022-12-06 03:14:06,378 INFO L131 PetriNetUnfolder]: For 7716/7716 co-relation queries the response was YES. [2022-12-06 03:14:06,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268746 conditions, 11177 events. 5524/11177 cut-off events. For 7716/7716 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 98786 event pairs, 0 based on Foata normal form. 37/8773 useless extension candidates. Maximal degree in co-relation 178818. Up to 11125 conditions per place. [2022-12-06 03:14:06,463 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 3387 selfloop transitions, 697 changer transitions 1709/5794 dead transitions. [2022-12-06 03:14:06,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 5794 transitions, 281008 flow [2022-12-06 03:14:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 03:14:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 03:14:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 293 transitions. [2022-12-06 03:14:06,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28952569169960474 [2022-12-06 03:14:06,465 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 384 predicate places. [2022-12-06 03:14:06,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:06,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 405 places, 5794 transitions, 281008 flow [2022-12-06 03:14:06,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 405 places, 5794 transitions, 281008 flow [2022-12-06 03:14:06,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 03:14:06,664 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:14:06,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 03:14:06,664 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 5794 transitions, 281008 flow [2022-12-06 03:14:06,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:06,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:06,665 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:06,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 03:14:06,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 03:14:06,872 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:14:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1604629686, now seen corresponding path program 6 times [2022-12-06 03:14:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:06,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301876319] [2022-12-06 03:14:06,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:07,796 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-06 03:14:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:07,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301876319] [2022-12-06 03:14:07,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301876319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:07,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701096438] [2022-12-06 03:14:07,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:14:07,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:07,798 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:07,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:14:07,900 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 03:14:07,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:14:07,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-06 03:14:07,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:07,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:14:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:14:07,927 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-06 03:14:07,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:14:07,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:14:08,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:14:08,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 03:14:08,366 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-06 03:14:08,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:08,903 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-06 03:14:08,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701096438] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:08,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:08,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 03:14:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312045068] [2022-12-06 03:14:08,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:08,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:14:08,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:14:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=614, Unknown=3, NotChecked=0, Total=756 [2022-12-06 03:14:08,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 03:14:08,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 5794 transitions, 281008 flow. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:08,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:08,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 03:14:08,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:16,086 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 77 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:14:24,692 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 85 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:14:40,402 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 96 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:15:20,570 INFO L130 PetriNetUnfolder]: 5860/11654 cut-off events. [2022-12-06 03:15:20,570 INFO L131 PetriNetUnfolder]: For 8387/8387 co-relation queries the response was YES. [2022-12-06 03:15:20,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291776 conditions, 11654 events. 5860/11654 cut-off events. For 8387/8387 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 101769 event pairs, 0 based on Foata normal form. 1/9068 useless extension candidates. Maximal degree in co-relation 198167. Up to 11600 conditions per place. [2022-12-06 03:15:20,660 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 3695 selfloop transitions, 583 changer transitions 1813/6092 dead transitions. [2022-12-06 03:15:20,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 6092 transitions, 307494 flow [2022-12-06 03:15:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 03:15:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 03:15:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 210 transitions. [2022-12-06 03:15:20,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 03:15:20,662 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 418 predicate places. [2022-12-06 03:15:20,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:15:20,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 6092 transitions, 307494 flow [2022-12-06 03:15:20,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 6092 transitions, 307494 flow [2022-12-06 03:15:20,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 03:15:24,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:15:24,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3727 [2022-12-06 03:15:24,389 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 6091 transitions, 307444 flow [2022-12-06 03:15:24,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:15:24,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:15:24,389 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:15:24,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 03:15:24,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-06 03:15:24,592 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:15:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:15:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -250713192, now seen corresponding path program 7 times [2022-12-06 03:15:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:15:24,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373226253] [2022-12-06 03:15:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:15:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:15:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:15:25,457 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-06 03:15:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:15:25,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373226253] [2022-12-06 03:15:25,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373226253] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:15:25,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115781] [2022-12-06 03:15:25,457 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:15:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:15:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:15:25,459 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:15:25,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:15:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:15:25,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 03:15:25,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:15:25,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:15:25,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 03:15:25,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:25,844 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 48 treesize of output 12 [2022-12-06 03:15:25,875 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-06 03:15:25,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:15:26,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:26,127 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 139 treesize of output 140 [2022-12-06 03:15:26,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:26,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 66 [2022-12-06 03:15:26,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:26,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 53 [2022-12-06 03:15:26,265 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-06 03:15:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:15:26,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:15:26,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:15:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966861487] [2022-12-06 03:15:26,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:15:26,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:15:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:15:26,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:15:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=571, Unknown=6, NotChecked=0, Total=650 [2022-12-06 03:15:26,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 03:15:26,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 6091 transitions, 307444 flow. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:15:26,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:15:26,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 03:15:26,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:16:04,990 INFO L130 PetriNetUnfolder]: 5992/11883 cut-off events. [2022-12-06 03:16:04,990 INFO L131 PetriNetUnfolder]: For 9763/9763 co-relation queries the response was YES. [2022-12-06 03:16:05,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309319 conditions, 11883 events. 5992/11883 cut-off events. For 9763/9763 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 103596 event pairs, 0 based on Foata normal form. 4/9241 useless extension candidates. Maximal degree in co-relation 206378. Up to 11823 conditions per place. [2022-12-06 03:16:05,086 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 4283 selfloop transitions, 78 changer transitions 1852/6214 dead transitions. [2022-12-06 03:16:05,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 6214 transitions, 326087 flow [2022-12-06 03:16:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:16:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:16:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2022-12-06 03:16:05,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3105590062111801 [2022-12-06 03:16:05,088 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 437 predicate places. [2022-12-06 03:16:05,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:16:05,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 6214 transitions, 326087 flow [2022-12-06 03:16:05,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 458 places, 6214 transitions, 326087 flow [2022-12-06 03:16:05,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 03:16:05,412 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:16:05,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 03:16:05,413 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 6214 transitions, 326087 flow [2022-12-06 03:16:05,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:16:05,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:16:05,413 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:16:05,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 03:16:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:16:05,619 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:16:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:16:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1147548105, now seen corresponding path program 1 times [2022-12-06 03:16:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:16:05,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209922864] [2022-12-06 03:16:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:16:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:16:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:16:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:16:06,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209922864] [2022-12-06 03:16:06,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209922864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:16:06,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604033036] [2022-12-06 03:16:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:16:06,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:16:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:16:06,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:16:06,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:16:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:16:06,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:16:06,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:16:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:06,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:16:06,345 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 03:16:06,345 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 26 treesize of output 18 [2022-12-06 03:16:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604033036] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:16:06,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:16:06,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 03:16:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81371955] [2022-12-06 03:16:06,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:16:06,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:16:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:16:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:16:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:16:06,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 03:16:06,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 6214 transitions, 326087 flow. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:16:06,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:16:06,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 03:16:06,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:16:47,987 INFO L130 PetriNetUnfolder]: 6040/11966 cut-off events. [2022-12-06 03:16:47,987 INFO L131 PetriNetUnfolder]: For 10887/10887 co-relation queries the response was YES. [2022-12-06 03:16:47,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323353 conditions, 11966 events. 6040/11966 cut-off events. For 10887/10887 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 103978 event pairs, 0 based on Foata normal form. 0/9331 useless extension candidates. Maximal degree in co-relation 214310. Up to 11904 conditions per place. [2022-12-06 03:16:48,228 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 4242 selfloop transitions, 172 changer transitions 1864/6282 dead transitions. [2022-12-06 03:16:48,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 6282 transitions, 342207 flow [2022-12-06 03:16:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:16:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:16:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2022-12-06 03:16:48,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4440993788819876 [2022-12-06 03:16:48,230 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 450 predicate places. [2022-12-06 03:16:48,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:16:48,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 471 places, 6282 transitions, 342207 flow [2022-12-06 03:16:48,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 471 places, 6282 transitions, 342207 flow [2022-12-06 03:16:48,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 03:16:48,444 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:16:48,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 03:16:48,444 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 6282 transitions, 342207 flow [2022-12-06 03:16:48,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:16:48,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:16:48,445 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:16:48,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:16:48,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:16:48,646 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:16:48,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:16:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash -647310839, now seen corresponding path program 2 times [2022-12-06 03:16:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:16:48,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601929496] [2022-12-06 03:16:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:16:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:16:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:16:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:16:49,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601929496] [2022-12-06 03:16:49,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601929496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:16:49,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43797572] [2022-12-06 03:16:49,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:16:49,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:16:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:16:49,252 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:16:49,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:16:49,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:16:49,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:16:49,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:16:49,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:16:49,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:16:49,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:16:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:49,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:16:49,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:16:49,513 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 47 treesize of output 44 [2022-12-06 03:16:49,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-12-06 03:16:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:49,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43797572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:16:49,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:16:49,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 03:16:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493081929] [2022-12-06 03:16:49,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:16:49,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:16:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:16:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:16:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=257, Unknown=5, NotChecked=0, Total=306 [2022-12-06 03:16:49,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 03:16:49,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 6282 transitions, 342207 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:16:49,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:16:49,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 03:16:49,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:17:32,163 INFO L130 PetriNetUnfolder]: 6142/12189 cut-off events. [2022-12-06 03:17:32,164 INFO L131 PetriNetUnfolder]: For 12578/12578 co-relation queries the response was YES. [2022-12-06 03:17:32,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341487 conditions, 12189 events. 6142/12189 cut-off events. For 12578/12578 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 106715 event pairs, 0 based on Foata normal form. 0/9519 useless extension candidates. Maximal degree in co-relation 222242. Up to 12125 conditions per place. [2022-12-06 03:17:32,327 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 4315 selfloop transitions, 199 changer transitions 1898/6416 dead transitions. [2022-12-06 03:17:32,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 6416 transitions, 362343 flow [2022-12-06 03:17:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:17:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:17:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2022-12-06 03:17:32,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 03:17:32,328 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 462 predicate places. [2022-12-06 03:17:32,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:17:32,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 483 places, 6416 transitions, 362343 flow [2022-12-06 03:17:32,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 483 places, 6416 transitions, 362343 flow [2022-12-06 03:17:32,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 03:17:32,605 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:17:32,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-06 03:17:32,606 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 6416 transitions, 362343 flow [2022-12-06 03:17:32,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:17:32,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:17:32,606 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:17:32,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 03:17:32,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 03:17:32,812 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:17:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:17:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1385640140, now seen corresponding path program 8 times [2022-12-06 03:17:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:17:32,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258024188] [2022-12-06 03:17:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:17:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:17:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:17:33,772 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-06 03:17:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:17:33,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258024188] [2022-12-06 03:17:33,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258024188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:17:33,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610892335] [2022-12-06 03:17:33,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:17:33,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:17:33,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:17:33,774 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:17:33,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:17:33,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:17:33,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:17:33,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-06 03:17:33,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:17:34,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:17:34,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:17:34,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:17:34,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:17:34,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 26 [2022-12-06 03:17:34,335 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-06 03:17:34,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:17:34,709 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 03:17:34,709 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 190 treesize of output 184 [2022-12-06 03:17:34,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:17:34,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 127 treesize of output 135 [2022-12-06 03:17:34,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:17:34,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 108 treesize of output 116 [2022-12-06 03:17:35,317 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-06 03:17:35,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610892335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:17:35,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:17:35,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:17:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321799196] [2022-12-06 03:17:35,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:17:35,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:17:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:17:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:17:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=545, Unknown=1, NotChecked=0, Total=650 [2022-12-06 03:17:35,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 03:17:35,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 6416 transitions, 362343 flow. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:17:35,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:17:35,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 03:17:35,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:17:44,359 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 79 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:17:54,377 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 89 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:18:02,717 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 89 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:18:12,459 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 68 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:18:15,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:18:23,961 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 97 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:18:27,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:18:44,134 WARN L233 SmtUtils]: Spent 16.39s on a formula simplification. DAG size of input: 111 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:18:52,519 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 89 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:19:00,954 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 88 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:19:11,105 WARN L233 SmtUtils]: Spent 8.43s on a formula simplification. DAG size of input: 94 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:19:35,206 WARN L233 SmtUtils]: Spent 20.48s on a formula simplification. DAG size of input: 95 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:19:43,708 WARN L233 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 112 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:19:52,844 WARN L233 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 89 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:20:02,308 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 92 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:20:29,174 WARN L233 SmtUtils]: Spent 24.70s on a formula simplification. DAG size of input: 91 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:20:38,260 WARN L233 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 107 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:20:50,942 WARN L233 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 83 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:22:17,313 INFO L130 PetriNetUnfolder]: 13291/25981 cut-off events. [2022-12-06 03:22:17,313 INFO L131 PetriNetUnfolder]: For 14725/14725 co-relation queries the response was YES. [2022-12-06 03:22:17,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754883 conditions, 25981 events. 13291/25981 cut-off events. For 14725/14725 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 248478 event pairs, 0 based on Foata normal form. 60/19850 useless extension candidates. Maximal degree in co-relation 527805. Up to 25919 conditions per place. [2022-12-06 03:22:17,542 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 5713 selfloop transitions, 3699 changer transitions 4880/14293 dead transitions. [2022-12-06 03:22:17,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 14293 transitions, 835717 flow [2022-12-06 03:22:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-06 03:22:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-06 03:22:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 463 transitions. [2022-12-06 03:22:17,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30500658761528326 [2022-12-06 03:22:17,545 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 526 predicate places. [2022-12-06 03:22:17,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:22:17,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 547 places, 14293 transitions, 835717 flow [2022-12-06 03:22:18,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 547 places, 14293 transitions, 835717 flow [2022-12-06 03:22:18,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 03:22:18,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:22:18,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 693 [2022-12-06 03:22:18,238 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 14293 transitions, 835717 flow [2022-12-06 03:22:18,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:22:18,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:22:18,239 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:22:18,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 03:22:18,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 03:22:18,446 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:22:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:22:18,446 INFO L85 PathProgramCache]: Analyzing trace with hash -82744162, now seen corresponding path program 9 times [2022-12-06 03:22:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:22:18,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694320075] [2022-12-06 03:22:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:22:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:22:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:22:19,247 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-06 03:22:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:22:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694320075] [2022-12-06 03:22:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694320075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:22:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399946893] [2022-12-06 03:22:19,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:22:19,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:22:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:22:19,249 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:22:19,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 03:22:19,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:22:19,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:22:19,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 03:22:19,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:22:19,377 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 24 treesize of output 32 [2022-12-06 03:22:19,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:22:19,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:22:19,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:22:19,833 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-06 03:22:19,833 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 46 treesize of output 15 [2022-12-06 03:22:19,865 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-06 03:22:19,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:22:26,431 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:22:28,575 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-06 03:22:28,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399946893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:22:28,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:22:28,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:22:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412500567] [2022-12-06 03:22:28,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:22:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:22:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:22:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:22:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=549, Unknown=3, NotChecked=0, Total=650 [2022-12-06 03:22:28,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 03:22:28,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 14293 transitions, 835717 flow. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:22:28,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:22:28,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 03:22:28,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:22:29,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (* c_~q_front~0 4)) (.cse11 (select |c_#memory_int| c_~q~0.base)) (.cse13 (+ c_~q~0.offset (* 4 c_~q_back~0)))) (let ((.cse7 (< c_~n~0 1)) (.cse8 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse10 (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (= (select .cse11 .cse13) 1))) (.cse3 (+ .cse17 c_~q~0.offset 4)) (.cse4 (+ .cse17 c_~q~0.offset)) (.cse5 (+ c_~q_back~0 1))) (and (or .cse0 .cse1 (and (forall ((v_~q_back~0_320 Int)) (or (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (not (= (select .cse2 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ c_~s~0 (select .cse2 .cse3) (select .cse2 .cse4)))))) (< c_~n~0 (+ 2 v_~q_back~0_320)) (not (<= .cse5 v_~q_back~0_320)))) (forall ((v_~q_back~0_320 Int)) (or (< c_~n~0 (+ 2 v_~q_back~0_320)) (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (not (= (select .cse6 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1)) (< (+ c_~s~0 (select .cse6 .cse3) (select .cse6 .cse4)) (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|))))) (not (<= .cse5 v_~q_back~0_320)))))) (or .cse1 .cse7 .cse8 (let ((.cse9 (+ c_~s~0 (select .cse11 .cse4) (select .cse11 .cse3)))) (and (< .cse9 .cse10) (< |c_thread1Thread1of1ForFork0_~i~0#1| .cse9)))) (or .cse7 .cse8 (and (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< (+ c_~s~0 (select .cse12 .cse3) (select .cse12 .cse4)) .cse10) (not (= (select .cse12 .cse13) 1))))) (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| (+ c_~s~0 (select .cse14 .cse3) (select .cse14 .cse4))) (not (= (select .cse14 .cse13) 1))))))) (or .cse0 .cse1 (and (forall ((v_~q_back~0_320 Int)) (or (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< (+ c_~s~0 (select .cse15 .cse3) (select .cse15 .cse4)) 3) (not (= (select .cse15 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1))))) (< c_~n~0 (+ 2 v_~q_back~0_320)) (not (<= .cse5 v_~q_back~0_320)))) (forall ((v_~q_back~0_320 Int)) (or (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< 1 (+ c_~s~0 (select .cse16 .cse3) (select .cse16 .cse4))) (not (= (select .cse16 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1))))) (< c_~n~0 (+ 2 v_~q_back~0_320)) (not (<= .cse5 v_~q_back~0_320))))))))) is different from false [2022-12-06 03:22:36,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:22:50,336 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:22:51,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~q_front~0 4))) (let ((.cse4 (+ .cse19 c_~q~0.offset)) (.cse12 (select |c_#memory_int| c_~q~0.base)) (.cse14 (+ c_~q~0.offset (* 4 c_~q_back~0)))) (let ((.cse7 (< c_~n~0 1)) (.cse8 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse10 (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (.cse1 (not (= (select .cse12 .cse14) 1))) (.cse3 (+ .cse19 c_~q~0.offset 4)) (.cse5 (+ c_~q_back~0 1)) (.cse11 (select .cse12 .cse4)) (.cse0 (not (<= 0 c_~q_back~0)))) (and (or .cse0 .cse1 (and (forall ((v_~q_back~0_320 Int)) (or (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (not (= (select .cse2 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ c_~s~0 (select .cse2 .cse3) (select .cse2 .cse4)))))) (< c_~n~0 (+ 2 v_~q_back~0_320)) (not (<= .cse5 v_~q_back~0_320)))) (forall ((v_~q_back~0_320 Int)) (or (< c_~n~0 (+ 2 v_~q_back~0_320)) (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (not (= (select .cse6 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1)) (< (+ c_~s~0 (select .cse6 .cse3) (select .cse6 .cse4)) (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|))))) (not (<= .cse5 v_~q_back~0_320)))))) (or .cse1 .cse7 .cse8 (let ((.cse9 (+ c_~s~0 .cse11 (select .cse12 .cse3)))) (and (< .cse9 .cse10) (< |c_thread1Thread1of1ForFork0_~i~0#1| .cse9)))) (or .cse7 .cse8 (and (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< (+ c_~s~0 (select .cse13 .cse3) (select .cse13 .cse4)) .cse10) (not (= (select .cse13 .cse14) 1))))) (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| (+ c_~s~0 (select .cse15 .cse3) (select .cse15 .cse4))) (not (= (select .cse15 .cse14) 1))))))) (or .cse0 .cse1 (and (forall ((v_~q_back~0_320 Int)) (or (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< (+ c_~s~0 (select .cse16 .cse3) (select .cse16 .cse4)) 3) (not (= (select .cse16 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1))))) (< c_~n~0 (+ 2 v_~q_back~0_320)) (not (<= .cse5 v_~q_back~0_320)))) (forall ((v_~q_back~0_320 Int)) (or (forall ((v_ArrVal_1095 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1095) c_~q~0.base))) (or (< 1 (+ c_~s~0 (select .cse17 .cse3) (select .cse17 .cse4))) (not (= (select .cse17 (+ c_~q~0.offset (* v_~q_back~0_320 4))) 1))))) (< c_~n~0 (+ 2 v_~q_back~0_320)) (not (<= .cse5 v_~q_back~0_320)))))) (or (let ((.cse18 (+ c_~s~0 .cse11))) (and (<= c_~N~0 .cse18) (< .cse18 (+ c_~N~0 1)))) .cse0 (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))))) is different from false [2022-12-06 03:22:55,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:22:57,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-06 03:24:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 03:24:30,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:24:30,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:30,787 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:24:30,787 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:24:30,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 03:24:30,971 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 1/23 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 342803 conditions, 11434 events (5873/11433 cut-off events. For 13377/13377 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 107629 event pairs, 0 based on Foata normal form. 5/9839 useless extension candidates. Maximal degree in co-relation 250865. Up to 11370 conditions per place.). [2022-12-06 03:24:30,972 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:24:30,972 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:24:30,973 INFO L458 BasicCegarLoop]: Path program histogram: [9, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:30,975 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:24:30,976 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:24:30,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:24:30 BasicIcfg [2022-12-06 03:24:30,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:24:30,978 INFO L158 Benchmark]: Toolchain (without parser) took 825215.47ms. Allocated memory was 175.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 139.4MB in the beginning and 550.1MB in the end (delta: -410.7MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 03:24:30,978 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:24:30,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.70ms. Allocated memory is still 175.1MB. Free memory was 139.2MB in the beginning and 127.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 03:24:30,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.50ms. Allocated memory is still 175.1MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:24:30,979 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 175.1MB. Free memory was 125.1MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:24:30,979 INFO L158 Benchmark]: RCFGBuilder took 564.15ms. Allocated memory is still 175.1MB. Free memory was 123.5MB in the beginning and 99.9MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 03:24:30,979 INFO L158 Benchmark]: TraceAbstraction took 824316.04ms. Allocated memory was 175.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 99.4MB in the beginning and 550.1MB in the end (delta: -450.8MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 03:24:30,980 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.12ms. Allocated memory is still 175.1MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.70ms. Allocated memory is still 175.1MB. Free memory was 139.2MB in the beginning and 127.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.50ms. Allocated memory is still 175.1MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 175.1MB. Free memory was 125.1MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 564.15ms. Allocated memory is still 175.1MB. Free memory was 123.5MB in the beginning and 99.9MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 824316.04ms. Allocated memory was 175.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 99.4MB in the beginning and 550.1MB in the end (delta: -450.8MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 110 PlacesBefore, 21 PlacesAfterwards, 114 TransitionsBefore, 17 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 19 ConcurrentYvCompositions, 7 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 317, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 292, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 292, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 292, unknown conditional: 0, unknown unconditional: 292] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 459, Positive conditional cache size: 0, Positive unconditional cache size: 459, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.7s, 24 PlacesBefore, 23 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 30 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 33 PlacesBefore, 32 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 40 PlacesBefore, 39 PlacesAfterwards, 96 TransitionsBefore, 95 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 327 TransitionsBefore, 327 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 307 TransitionsBefore, 307 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 459 TransitionsBefore, 459 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 621 TransitionsBefore, 621 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 131 PlacesBefore, 131 PlacesAfterwards, 814 TransitionsBefore, 814 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 160 PlacesBefore, 160 PlacesAfterwards, 1051 TransitionsBefore, 1051 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 167 PlacesBefore, 167 PlacesAfterwards, 1071 TransitionsBefore, 1071 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 177 PlacesBefore, 177 PlacesAfterwards, 1039 TransitionsBefore, 1039 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 192 PlacesBefore, 192 PlacesAfterwards, 1075 TransitionsBefore, 1075 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 205 PlacesBefore, 205 PlacesAfterwards, 1090 TransitionsBefore, 1090 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 185 PlacesBefore, 185 PlacesAfterwards, 467 TransitionsBefore, 467 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 238 PlacesBefore, 236 PlacesAfterwards, 878 TransitionsBefore, 876 TransitionsAfterwards, 300 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 268 PlacesBefore, 268 PlacesAfterwards, 1784 TransitionsBefore, 1784 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 294 PlacesBefore, 294 PlacesAfterwards, 2269 TransitionsBefore, 2269 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 329 PlacesBefore, 329 PlacesAfterwards, 2670 TransitionsBefore, 2670 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 360 PlacesBefore, 360 PlacesAfterwards, 3890 TransitionsBefore, 3890 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 405 PlacesBefore, 405 PlacesAfterwards, 5794 TransitionsBefore, 5794 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 439 PlacesBefore, 438 PlacesAfterwards, 6092 TransitionsBefore, 6091 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 458 PlacesBefore, 458 PlacesAfterwards, 6214 TransitionsBefore, 6214 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 471 PlacesBefore, 471 PlacesAfterwards, 6282 TransitionsBefore, 6282 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 483 PlacesBefore, 483 PlacesAfterwards, 6416 TransitionsBefore, 6416 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 547 PlacesBefore, 547 PlacesAfterwards, 14293 TransitionsBefore, 14293 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 1/23 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 342803 conditions, 11434 events (5873/11433 cut-off events. For 13377/13377 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 107629 event pairs, 0 based on Foata normal form. 5/9839 useless extension candidates. Maximal degree in co-relation 250865. Up to 11370 conditions per place.). - TimeoutResultAtElement [Line: 93]: 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 (26states, 1/23 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 342803 conditions, 11434 events (5873/11433 cut-off events. For 13377/13377 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 107629 event pairs, 0 based on Foata normal form. 5/9839 useless extension candidates. Maximal degree in co-relation 250865. Up to 11370 conditions per place.). - TimeoutResultAtElement [Line: 92]: 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 (26states, 1/23 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 342803 conditions, 11434 events (5873/11433 cut-off events. For 13377/13377 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 107629 event pairs, 0 based on Foata normal form. 5/9839 useless extension candidates. Maximal degree in co-relation 250865. Up to 11370 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 134 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: 824.2s, OverallIterations: 29, TraceHistogramMax: 3, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 757.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 197 mSolverCounterUnknown, 3575 SdHoareTripleChecker+Valid, 59.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3575 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 57.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 314 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 2034 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16125 IncrementalHoareTripleChecker+Invalid, 18670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2034 mSolverCounterUnsat, 20 mSDtfsCounter, 16125 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 468 SyntacticMatches, 27 SemanticMatches, 891 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 9564 ImplicationChecksByTransitivity, 318.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=835717occurred in iteration=28, InterpolantAutomatonStates: 594, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 37.1s InterpolantComputationTime, 867 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1158 ConstructedInterpolants, 53 QuantifiedInterpolants, 27719 SizeOfPredicates, 432 NumberOfNonLiveVariables, 5486 ConjunctsInSsa, 1016 ConjunctsInUnsatCore, 78 InterpolantComputations, 6 PerfectInterpolantSequences, 22/277 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