/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-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:42:57,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:42:57,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:42:57,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:42:57,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:42:57,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:42:57,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:42:57,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:42:57,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:42:57,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:42:57,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:42:57,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:42:57,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:42:57,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:42:57,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:42:57,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:42:57,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:42:57,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:42:57,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:42:57,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:42:57,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:42:57,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:42:57,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:42:57,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:42:57,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:42:57,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:42:57,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:42:57,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:42:57,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:42:57,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:42:57,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:42:57,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:42:57,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:42:57,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:42:57,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:42:57,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:42:57,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:42:57,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:42:57,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:42:57,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:42:57,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:42:57,449 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 02:42:57,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:42:57,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:42:57,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:42:57,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:42:57,476 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:42:57,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:42:57,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:42:57,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:42:57,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:42:57,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:42:57,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:42:57,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:42:57,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:42:57,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:42:57,480 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 02:42:57,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:42:57,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:42:57,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:42:57,777 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:42:57,777 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:42:57,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-06 02:42:58,929 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:42:59,116 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:42:59,116 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-06 02:42:59,121 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de6ac120/773c5d1e662042adb42f4df9e41eeb93/FLAG2a405a423 [2022-12-06 02:42:59,131 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de6ac120/773c5d1e662042adb42f4df9e41eeb93 [2022-12-06 02:42:59,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:42:59,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:42:59,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:42:59,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:42:59,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:42:59,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59, skipping insertion in model container [2022-12-06 02:42:59,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:42:59,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:42:59,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,269 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-more-array-sum.wvr.c[2835,2848] [2022-12-06 02:42:59,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:42:59,288 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:42:59,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:59,339 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-more-array-sum.wvr.c[2835,2848] [2022-12-06 02:42:59,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:42:59,359 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:42:59,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59 WrapperNode [2022-12-06 02:42:59,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:42:59,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:42:59,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:42:59,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:42:59,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,423 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 280 [2022-12-06 02:42:59,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:42:59,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:42:59,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:42:59,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:42:59,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,470 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:42:59,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:42:59,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:42:59,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:42:59,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (1/1) ... [2022-12-06 02:42:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:42:59,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:59,542 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 02:42:59,560 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 02:42:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:42:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:42:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:42:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:42:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:42:59,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:42:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:42:59,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:42:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:42:59,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:42:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:42:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:42:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:42:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:42:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:42:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:42:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:42:59,596 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 02:42:59,692 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:42:59,694 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:43:00,075 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:43:00,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:43:00,279 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 02:43:00,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:43:00 BoogieIcfgContainer [2022-12-06 02:43:00,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:43:00,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:43:00,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:43:00,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:43:00,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:42:59" (1/3) ... [2022-12-06 02:43:00,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19909321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:43:00, skipping insertion in model container [2022-12-06 02:43:00,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:59" (2/3) ... [2022-12-06 02:43:00,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19909321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:43:00, skipping insertion in model container [2022-12-06 02:43:00,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:43:00" (3/3) ... [2022-12-06 02:43:00,286 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-12-06 02:43:00,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:43:00,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:43:00,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:43:00,361 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:43:00,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 179 transitions, 382 flow [2022-12-06 02:43:00,481 INFO L130 PetriNetUnfolder]: 16/176 cut-off events. [2022-12-06 02:43:00,481 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:43:00,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 176 events. 16/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 108 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-12-06 02:43:00,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 179 transitions, 382 flow [2022-12-06 02:43:00,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 166 transitions, 350 flow [2022-12-06 02:43:00,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:00,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-06 02:43:00,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 166 transitions, 350 flow [2022-12-06 02:43:00,563 INFO L130 PetriNetUnfolder]: 16/166 cut-off events. [2022-12-06 02:43:00,564 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:43:00,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 166 events. 16/166 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-12-06 02:43:00,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-06 02:43:00,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 02:43:06,229 INFO L203 LiptonReduction]: Total number of compositions: 138 [2022-12-06 02:43:06,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:43:06,245 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;@527d6143, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:43:06,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:43:06,249 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 02:43:06,249 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:43:06,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:06,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:06,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 597230375, now seen corresponding path program 1 times [2022-12-06 02:43:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289881705] [2022-12-06 02:43:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:06,587 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 02:43:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:06,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289881705] [2022-12-06 02:43:06,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289881705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:43:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795310548] [2022-12-06 02:43:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:43:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:43:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:43:06,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 02:43:06,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 02:43:06,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:06,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 02:43:06,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:06,827 INFO L130 PetriNetUnfolder]: 620/871 cut-off events. [2022-12-06 02:43:06,827 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 02:43:06,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 871 events. 620/871 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3409 event pairs, 95 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 1365. Up to 688 conditions per place. [2022-12-06 02:43:06,852 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2022-12-06 02:43:06,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 211 flow [2022-12-06 02:43:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:43:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:43:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 02:43:06,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-06 02:43:06,864 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2022-12-06 02:43:06,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:06,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 46 transitions, 211 flow [2022-12-06 02:43:06,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 46 transitions, 211 flow [2022-12-06 02:43:06,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 02:43:06,892 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:06,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 02:43:06,895 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 46 transitions, 211 flow [2022-12-06 02:43:06,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 02:43:06,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:06,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:06,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:43:06,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:06,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1243665619, now seen corresponding path program 1 times [2022-12-06 02:43:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:06,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359963564] [2022-12-06 02:43:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:07,083 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 02:43:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:07,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359963564] [2022-12-06 02:43:07,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359963564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:07,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:07,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:43:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763876] [2022-12-06 02:43:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:07,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:43:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:43:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:43:07,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:43:07,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 46 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 02:43:07,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:07,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:43:07,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:07,219 INFO L130 PetriNetUnfolder]: 643/925 cut-off events. [2022-12-06 02:43:07,220 INFO L131 PetriNetUnfolder]: For 87/107 co-relation queries the response was YES. [2022-12-06 02:43:07,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 925 events. 643/925 cut-off events. For 87/107 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3801 event pairs, 154 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 2117. Up to 912 conditions per place. [2022-12-06 02:43:07,224 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 41 selfloop transitions, 4 changer transitions 2/49 dead transitions. [2022-12-06 02:43:07,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 317 flow [2022-12-06 02:43:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:43:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:43:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 02:43:07,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 02:43:07,226 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2022-12-06 02:43:07,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:07,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 49 transitions, 317 flow [2022-12-06 02:43:07,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 49 transitions, 317 flow [2022-12-06 02:43:07,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 02:43:07,231 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:07,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:43:07,232 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 49 transitions, 317 flow [2022-12-06 02:43:07,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 02:43:07,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:07,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:07,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:43:07,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -713380074, now seen corresponding path program 1 times [2022-12-06 02:43:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372977430] [2022-12-06 02:43:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:07,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372977430] [2022-12-06 02:43:07,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372977430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:07,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308563001] [2022-12-06 02:43:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:07,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:07,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:07,346 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 02:43:07,397 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 02:43:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:07,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:43:07,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:07,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:07,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308563001] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:07,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:43:07,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-12-06 02:43:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547766293] [2022-12-06 02:43:07,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:07,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:43:07,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:43:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:43:07,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 02:43:07,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 49 transitions, 317 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 02:43:07,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:07,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 02:43:07,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:07,957 INFO L130 PetriNetUnfolder]: 895/1319 cut-off events. [2022-12-06 02:43:07,958 INFO L131 PetriNetUnfolder]: For 860/860 co-relation queries the response was YES. [2022-12-06 02:43:07,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 1319 events. 895/1319 cut-off events. For 860/860 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4967 event pairs, 78 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 3720. Up to 1167 conditions per place. [2022-12-06 02:43:07,968 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 89 selfloop transitions, 19 changer transitions 1/110 dead transitions. [2022-12-06 02:43:07,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 110 transitions, 929 flow [2022-12-06 02:43:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:43:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:43:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-06 02:43:07,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-06 02:43:07,970 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-12-06 02:43:07,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:07,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 110 transitions, 929 flow [2022-12-06 02:43:07,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 110 transitions, 929 flow [2022-12-06 02:43:07,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-06 02:43:07,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:07,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 02:43:07,980 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 110 transitions, 929 flow [2022-12-06 02:43:07,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 02:43:07,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:07,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:07,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:43:08,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:08,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1840001028, now seen corresponding path program 1 times [2022-12-06 02:43:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:08,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532988274] [2022-12-06 02:43:08,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:08,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532988274] [2022-12-06 02:43:08,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532988274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519514617] [2022-12-06 02:43:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:08,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:08,297 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 02:43:08,298 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 02:43:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:08,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:43:08,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:08,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:08,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519514617] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:08,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:43:08,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-06 02:43:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085714308] [2022-12-06 02:43:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:43:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:43:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:43:08,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:43:08,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 110 transitions, 929 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 02:43:08,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:08,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:43:08,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:08,672 INFO L130 PetriNetUnfolder]: 928/1340 cut-off events. [2022-12-06 02:43:08,672 INFO L131 PetriNetUnfolder]: For 1686/1796 co-relation queries the response was YES. [2022-12-06 02:43:08,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6339 conditions, 1340 events. 928/1340 cut-off events. For 1686/1796 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5055 event pairs, 68 based on Foata normal form. 16/1088 useless extension candidates. Maximal degree in co-relation 5980. Up to 1225 conditions per place. [2022-12-06 02:43:08,680 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 128 selfloop transitions, 11 changer transitions 1/144 dead transitions. [2022-12-06 02:43:08,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 144 transitions, 1478 flow [2022-12-06 02:43:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:43:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:43:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 02:43:08,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2022-12-06 02:43:08,691 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-06 02:43:08,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:08,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 144 transitions, 1478 flow [2022-12-06 02:43:08,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 144 transitions, 1478 flow [2022-12-06 02:43:08,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-06 02:43:08,698 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:08,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:43:08,699 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 144 transitions, 1478 flow [2022-12-06 02:43:08,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 02:43:08,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:08,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:08,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:43:08,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 02:43:08,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash 818055792, now seen corresponding path program 1 times [2022-12-06 02:43:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:08,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614671544] [2022-12-06 02:43:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614671544] [2022-12-06 02:43:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614671544] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952926303] [2022-12-06 02:43:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:09,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:09,683 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 02:43:09,685 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 02:43:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:09,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 02:43:09,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:10,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:10,099 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:43:10,100 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 31 treesize of output 25 [2022-12-06 02:43:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:10,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:10,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:10,193 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 41 treesize of output 94 [2022-12-06 02:43:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952926303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:10,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-12-06 02:43:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525943534] [2022-12-06 02:43:10,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:10,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:43:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:10,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:43:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-12-06 02:43:10,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 02:43:10,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 144 transitions, 1478 flow. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 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 02:43:10,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:10,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 02:43:10,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:11,873 INFO L130 PetriNetUnfolder]: 3042/4424 cut-off events. [2022-12-06 02:43:11,873 INFO L131 PetriNetUnfolder]: For 5087/5195 co-relation queries the response was YES. [2022-12-06 02:43:11,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25290 conditions, 4424 events. 3042/4424 cut-off events. For 5087/5195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20915 event pairs, 40 based on Foata normal form. 41/3562 useless extension candidates. Maximal degree in co-relation 16502. Up to 4051 conditions per place. [2022-12-06 02:43:11,903 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 489 selfloop transitions, 171 changer transitions 10/672 dead transitions. [2022-12-06 02:43:11,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 672 transitions, 8280 flow [2022-12-06 02:43:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 02:43:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 02:43:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 320 transitions. [2022-12-06 02:43:11,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2022-12-06 02:43:11,908 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2022-12-06 02:43:11,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:11,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 672 transitions, 8280 flow [2022-12-06 02:43:11,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 672 transitions, 8280 flow [2022-12-06 02:43:11,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 02:43:18,518 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 02:43:18,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6610 [2022-12-06 02:43:18,519 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 667 transitions, 8220 flow [2022-12-06 02:43:18,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 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 02:43:18,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:18,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:18,526 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 02:43:18,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:18,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash 445683643, now seen corresponding path program 1 times [2022-12-06 02:43:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:18,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743856520] [2022-12-06 02:43:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:20,092 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 02:43:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743856520] [2022-12-06 02:43:20,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743856520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812578405] [2022-12-06 02:43:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:20,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:20,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:20,094 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 02:43:20,123 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 02:43:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:20,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 02:43:20,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:20,271 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-06 02:43:20,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-06 02:43:20,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:43:20,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 02:43:20,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 17 [2022-12-06 02:43:20,321 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 9 treesize of output 7 [2022-12-06 02:43:20,342 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:20,343 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2022-12-06 02:43:20,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:20,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:20,445 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 02:43:20,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 44 [2022-12-06 02:43:20,450 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 9 treesize of output 7 [2022-12-06 02:43:20,530 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 02:43:20,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:20,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:20,720 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 02:43:20,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 02:43:20,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:20,833 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:43:20,834 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 31 treesize of output 25 [2022-12-06 02:43:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:20,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:20,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_271 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) c_~res1~0)) is different from false [2022-12-06 02:43:20,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_271 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (let ((.cse2 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)) c_~res1~0)))) is different from false [2022-12-06 02:43:20,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_271 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0))) is different from false [2022-12-06 02:43:20,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271)) (.cse1 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) (select (select .cse2 c_~B~0.base) c_~B~0.offset))))) is different from false [2022-12-06 02:43:21,086 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 02:43:21,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812578405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:21,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:21,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2022-12-06 02:43:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993102104] [2022-12-06 02:43:21,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:21,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:43:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:21,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:43:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=487, Unknown=7, NotChecked=188, Total=756 [2022-12-06 02:43:21,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 02:43:21,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 667 transitions, 8220 flow. Second operand has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 28 states have internal predecessors, (80), 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 02:43:21,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:21,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 02:43:21,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:21,825 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271)) (.cse1 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) (select (select .cse2 c_~B~0.base) c_~B~0.offset))))) (= c_~res2~0 c_~res1~0) (< 0 (+ c_~M~0 1))) is different from false [2022-12-06 02:43:24,869 INFO L130 PetriNetUnfolder]: 5764/8396 cut-off events. [2022-12-06 02:43:24,869 INFO L131 PetriNetUnfolder]: For 11285/11441 co-relation queries the response was YES. [2022-12-06 02:43:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56285 conditions, 8396 events. 5764/8396 cut-off events. For 11285/11441 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 43666 event pairs, 48 based on Foata normal form. 27/6609 useless extension candidates. Maximal degree in co-relation 21354. Up to 7736 conditions per place. [2022-12-06 02:43:24,945 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 1142 selfloop transitions, 253 changer transitions 22/1419 dead transitions. [2022-12-06 02:43:24,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 1419 transitions, 20395 flow [2022-12-06 02:43:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:43:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:43:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 317 transitions. [2022-12-06 02:43:24,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3526140155728587 [2022-12-06 02:43:24,949 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 65 predicate places. [2022-12-06 02:43:24,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:24,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 1419 transitions, 20395 flow [2022-12-06 02:43:24,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 1419 transitions, 20395 flow [2022-12-06 02:43:25,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 02:43:27,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] and [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#1] [2022-12-06 02:43:27,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] and [959] L61-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_In_3| v_~M~0_In_6)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, ~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] [2022-12-06 02:43:27,136 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] and [945] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre24#1_31|) (= |v_#memory_int_174| (store |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39| (store (select |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre24#1_31|))) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_21|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_31|, #memory_int=|v_#memory_int_174|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 02:43:27,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] and [945] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre24#1_31|) (= |v_#memory_int_174| (store |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39| (store (select |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre24#1_31|))) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_21|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_31|, #memory_int=|v_#memory_int_174|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 02:43:27,417 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 02:43:27,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2468 [2022-12-06 02:43:27,417 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 1417 transitions, 20375 flow [2022-12-06 02:43:27,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 28 states have internal predecessors, (80), 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 02:43:27,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:27,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:27,427 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 02:43:27,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:27,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1387281165, now seen corresponding path program 1 times [2022-12-06 02:43:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:27,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076669142] [2022-12-06 02:43:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:27,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076669142] [2022-12-06 02:43:27,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076669142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:27,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:27,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:43:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061644904] [2022-12-06 02:43:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:27,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:43:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:27,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:43:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:43:27,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-06 02:43:27,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 1417 transitions, 20375 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 02:43:27,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:27,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-06 02:43:27,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:28,950 INFO L130 PetriNetUnfolder]: 4308/6284 cut-off events. [2022-12-06 02:43:28,950 INFO L131 PetriNetUnfolder]: For 12128/12222 co-relation queries the response was YES. [2022-12-06 02:43:28,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47952 conditions, 6284 events. 4308/6284 cut-off events. For 12128/12222 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31475 event pairs, 120 based on Foata normal form. 0/4864 useless extension candidates. Maximal degree in co-relation 32318. Up to 5838 conditions per place. [2022-12-06 02:43:29,000 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 905 selfloop transitions, 1 changer transitions 18/942 dead transitions. [2022-12-06 02:43:29,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 942 transitions, 15438 flow [2022-12-06 02:43:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:43:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:43:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 02:43:29,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2022-12-06 02:43:29,002 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2022-12-06 02:43:29,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:29,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 942 transitions, 15438 flow [2022-12-06 02:43:29,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 942 transitions, 15438 flow [2022-12-06 02:43:29,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 02:43:29,050 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:29,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 02:43:29,051 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 942 transitions, 15438 flow [2022-12-06 02:43:29,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 02:43:29,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:29,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:29,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:43:29,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1482157390, now seen corresponding path program 1 times [2022-12-06 02:43:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884848508] [2022-12-06 02:43:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:29,928 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 02:43:29,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884848508] [2022-12-06 02:43:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884848508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606263535] [2022-12-06 02:43:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:29,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:29,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:29,930 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 02:43:29,932 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 02:43:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:30,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-06 02:43:30,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:30,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:30,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:30,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:30,067 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:43:30,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 02:43:30,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:43:30,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:30,075 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 18 treesize of output 16 [2022-12-06 02:43:30,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:30,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:30,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:30,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 02:43:30,391 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 02:43:30,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:30,687 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((~M~0 Int) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387))) (let ((.cse2 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 c_~B~0.offset)) c_~res2~0)) (+ c_~res1~0 (select .cse2 c_~B~0.offset) (select .cse0 c_~A~0.offset))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-12-06 02:43:30,700 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 02:43:30,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606263535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:30,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:30,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 25 [2022-12-06 02:43:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995784719] [2022-12-06 02:43:30,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:30,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:43:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:43:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=4, NotChecked=48, Total=702 [2022-12-06 02:43:30,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:43:30,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 942 transitions, 15438 flow. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:30,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:30,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:43:30,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:35,361 INFO L130 PetriNetUnfolder]: 8877/13665 cut-off events. [2022-12-06 02:43:35,361 INFO L131 PetriNetUnfolder]: For 12282/12282 co-relation queries the response was YES. [2022-12-06 02:43:35,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119118 conditions, 13665 events. 8877/13665 cut-off events. For 12282/12282 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 86283 event pairs, 53 based on Foata normal form. 4/10600 useless extension candidates. Maximal degree in co-relation 83702. Up to 12814 conditions per place. [2022-12-06 02:43:35,452 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 2044 selfloop transitions, 797 changer transitions 132/2973 dead transitions. [2022-12-06 02:43:35,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 2973 transitions, 54740 flow [2022-12-06 02:43:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:43:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:43:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 335 transitions. [2022-12-06 02:43:35,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2022-12-06 02:43:35,456 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places. [2022-12-06 02:43:35,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:35,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 2973 transitions, 54740 flow [2022-12-06 02:43:35,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 2973 transitions, 54740 flow [2022-12-06 02:43:35,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:35,671 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:35,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 02:43:35,672 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 2973 transitions, 54740 flow [2022-12-06 02:43:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:35,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:35,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:35,677 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 02:43:35,876 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 02:43:35,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash 713675538, now seen corresponding path program 2 times [2022-12-06 02:43:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:35,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133664791] [2022-12-06 02:43:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:36,842 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 02:43:36,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:36,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133664791] [2022-12-06 02:43:36,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133664791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:36,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944993763] [2022-12-06 02:43:36,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:43:36,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:36,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:36,860 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 02:43:36,861 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 02:43:36,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:43:36,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:36,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-06 02:43:36,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:36,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:36,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:36,981 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:43:36,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 02:43:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:36,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:36,987 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 14 treesize of output 12 [2022-12-06 02:43:36,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:43:37,035 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 02:43:37,084 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 02:43:37,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:37,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-06 02:43:37,291 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 02:43:37,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:37,439 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (let ((.cse1 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse1 c_~B~0.offset)) (let ((.cse2 (* 4 c_~M~0))) (+ (select .cse1 (+ .cse2 c_~B~0.offset)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2)))))))) is different from false [2022-12-06 02:43:37,443 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 02:43:37,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944993763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:37,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:37,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-12-06 02:43:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664080909] [2022-12-06 02:43:37,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:43:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:43:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=452, Unknown=12, NotChecked=44, Total=600 [2022-12-06 02:43:37,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:43:37,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 2973 transitions, 54740 flow. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:37,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:37,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:43:37,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:44,637 INFO L130 PetriNetUnfolder]: 10008/15334 cut-off events. [2022-12-06 02:43:44,637 INFO L131 PetriNetUnfolder]: For 14309/14309 co-relation queries the response was YES. [2022-12-06 02:43:44,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148477 conditions, 15334 events. 10008/15334 cut-off events. For 14309/14309 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 98210 event pairs, 53 based on Foata normal form. 4/11891 useless extension candidates. Maximal degree in co-relation 108228. Up to 14405 conditions per place. [2022-12-06 02:43:44,763 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 2757 selfloop transitions, 424 changer transitions 142/3355 dead transitions. [2022-12-06 02:43:44,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 3355 transitions, 68385 flow [2022-12-06 02:43:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:43:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:43:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 173 transitions. [2022-12-06 02:43:44,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32037037037037036 [2022-12-06 02:43:44,765 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2022-12-06 02:43:44,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:44,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 3355 transitions, 68385 flow [2022-12-06 02:43:44,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 3355 transitions, 68385 flow [2022-12-06 02:43:44,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:45,005 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:45,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 02:43:45,006 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 3355 transitions, 68385 flow [2022-12-06 02:43:45,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:45,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:45,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:45,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:43:45,207 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 02:43:45,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -886762316, now seen corresponding path program 3 times [2022-12-06 02:43:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55975567] [2022-12-06 02:43:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:45,771 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 02:43:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55975567] [2022-12-06 02:43:45,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55975567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801752798] [2022-12-06 02:43:45,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:43:45,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:45,773 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 02:43:45,775 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 02:43:45,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:43:45,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:45,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 02:43:45,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:46,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:46,059 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:43:46,060 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 31 treesize of output 25 [2022-12-06 02:43:46,077 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 02:43:46,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:46,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:46,126 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 41 treesize of output 94 [2022-12-06 02:43:46,288 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 02:43:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801752798] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:46,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:46,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-12-06 02:43:46,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415455977] [2022-12-06 02:43:46,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:46,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:43:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:43:46,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:43:46,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:43:46,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 3355 transitions, 68385 flow. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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 02:43:46,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:46,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:43:46,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:53,866 INFO L130 PetriNetUnfolder]: 11207/17207 cut-off events. [2022-12-06 02:43:53,867 INFO L131 PetriNetUnfolder]: For 16702/16702 co-relation queries the response was YES. [2022-12-06 02:43:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183467 conditions, 17207 events. 11207/17207 cut-off events. For 16702/16702 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 113024 event pairs, 55 based on Foata normal form. 8/13278 useless extension candidates. Maximal degree in co-relation 137346. Up to 16216 conditions per place. [2022-12-06 02:43:53,984 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 3159 selfloop transitions, 477 changer transitions 182/3850 dead transitions. [2022-12-06 02:43:53,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 3850 transitions, 86218 flow [2022-12-06 02:43:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:43:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:43:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 205 transitions. [2022-12-06 02:43:53,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-06 02:43:53,986 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 114 predicate places. [2022-12-06 02:43:53,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:53,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 3850 transitions, 86218 flow [2022-12-06 02:43:54,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 3850 transitions, 86218 flow [2022-12-06 02:43:54,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:54,124 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:54,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 02:43:54,125 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 3850 transitions, 86218 flow [2022-12-06 02:43:54,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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 02:43:54,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:54,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:54,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:54,329 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 02:43:54,331 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1353048380, now seen corresponding path program 4 times [2022-12-06 02:43:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:54,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581073899] [2022-12-06 02:43:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:55,329 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 02:43:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581073899] [2022-12-06 02:43:55,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581073899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906100639] [2022-12-06 02:43:55,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:43:55,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:55,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:55,341 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 02:43:55,391 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 02:43:55,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:43:55,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:55,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 02:43:55,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:55,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:55,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:55,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:55,532 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:43:55,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 02:43:55,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:55,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:55,538 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 14 treesize of output 12 [2022-12-06 02:43:55,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:43:55,574 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 02:43:55,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:55,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:55,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-06 02:43:55,920 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 02:43:55,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:56,137 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 02:43:56,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906100639] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:56,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:56,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 26 [2022-12-06 02:43:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666706091] [2022-12-06 02:43:56,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:56,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:43:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:43:56,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:43:56,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:43:56,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 3850 transitions, 86218 flow. Second operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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 02:43:56,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:56,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:43:56,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:10,636 INFO L130 PetriNetUnfolder]: 13657/21037 cut-off events. [2022-12-06 02:44:10,637 INFO L131 PetriNetUnfolder]: For 19538/19538 co-relation queries the response was YES. [2022-12-06 02:44:10,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245287 conditions, 21037 events. 13657/21037 cut-off events. For 19538/19538 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 143843 event pairs, 52 based on Foata normal form. 10/16348 useless extension candidates. Maximal degree in co-relation 125858. Up to 19802 conditions per place. [2022-12-06 02:44:10,837 INFO L137 encePairwiseOnDemand]: 13/30 looper letters, 3719 selfloop transitions, 1023 changer transitions 261/5003 dead transitions. [2022-12-06 02:44:10,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 5003 transitions, 121373 flow [2022-12-06 02:44:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-06 02:44:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-06 02:44:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 411 transitions. [2022-12-06 02:44:10,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28541666666666665 [2022-12-06 02:44:10,842 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 161 predicate places. [2022-12-06 02:44:10,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:10,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 5003 transitions, 121373 flow [2022-12-06 02:44:11,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 5003 transitions, 121373 flow [2022-12-06 02:44:11,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:11,033 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:11,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 02:44:11,034 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 5003 transitions, 121373 flow [2022-12-06 02:44:11,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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 02:44:11,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:11,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:11,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 02:44:11,238 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 02:44:11,241 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash -608359014, now seen corresponding path program 5 times [2022-12-06 02:44:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745994753] [2022-12-06 02:44:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:12,317 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 02:44:12,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745994753] [2022-12-06 02:44:12,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745994753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562721142] [2022-12-06 02:44:12,317 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:44:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:12,328 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 02:44:12,330 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 02:44:12,430 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:12,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:12,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-06 02:44:12,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:12,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 02:44:12,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,461 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 10 treesize of output 8 [2022-12-06 02:44:12,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-06 02:44:12,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:12,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:12,478 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 02:44:12,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 02:44:12,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:12,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 02:44:12,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:12,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 02:44:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:12,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:14,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_727 (Array Int Int))) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (= c_~res1~0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_727)) (.cse1 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset))))))) is different from false [2022-12-06 02:44:16,993 WARN L837 $PredicateComparison]: unable to prove that (forall ((|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (= c_~res1~0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_727)) (.cse1 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset))))))) is different from false [2022-12-06 02:44:17,107 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 02:44:17,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562721142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:17,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:17,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-06 02:44:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047671082] [2022-12-06 02:44:17,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:17,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:44:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:44:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=391, Unknown=3, NotChecked=82, Total=552 [2022-12-06 02:44:17,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:44:17,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 5003 transitions, 121373 flow. Second operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 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 02:44:17,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:17,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:44:17,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:36,252 INFO L130 PetriNetUnfolder]: 16393/25209 cut-off events. [2022-12-06 02:44:36,253 INFO L131 PetriNetUnfolder]: For 25991/25991 co-relation queries the response was YES. [2022-12-06 02:44:36,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318132 conditions, 25209 events. 16393/25209 cut-off events. For 25991/25991 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 176566 event pairs, 46 based on Foata normal form. 12/19635 useless extension candidates. Maximal degree in co-relation 241135. Up to 23716 conditions per place. [2022-12-06 02:44:36,442 INFO L137 encePairwiseOnDemand]: 14/30 looper letters, 4385 selfloop transitions, 1334 changer transitions 336/6129 dead transitions. [2022-12-06 02:44:36,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 6129 transitions, 161115 flow [2022-12-06 02:44:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:44:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:44:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 367 transitions. [2022-12-06 02:44:36,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3946236559139785 [2022-12-06 02:44:36,445 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 191 predicate places. [2022-12-06 02:44:36,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:36,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 6129 transitions, 161115 flow [2022-12-06 02:44:36,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 6129 transitions, 161115 flow [2022-12-06 02:44:36,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:36,648 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:36,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 02:44:36,648 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 6129 transitions, 161115 flow [2022-12-06 02:44:36,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 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 02:44:36,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:36,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:36,654 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 02:44:36,853 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 02:44:36,853 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1647669510, now seen corresponding path program 6 times [2022-12-06 02:44:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:36,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009444233] [2022-12-06 02:44:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:36,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:37,229 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 02:44:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009444233] [2022-12-06 02:44:37,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009444233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178464165] [2022-12-06 02:44:37,230 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:44:37,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:37,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:37,235 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 02:44:37,237 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 02:44:37,357 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:44:37,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:37,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:44:37,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:37,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:44:37,572 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:44:37,573 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 31 treesize of output 25 [2022-12-06 02:44:37,582 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 02:44:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:37,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:37,655 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 33 treesize of output 82 [2022-12-06 02:44:37,799 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 02:44:37,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178464165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:37,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:37,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2022-12-06 02:44:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923712757] [2022-12-06 02:44:37,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:37,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:44:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:44:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:44:37,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:44:37,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 6129 transitions, 161115 flow. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 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 02:44:37,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:37,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:44:37,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:02,377 INFO L130 PetriNetUnfolder]: 16106/24831 cut-off events. [2022-12-06 02:45:02,377 INFO L131 PetriNetUnfolder]: For 27081/27081 co-relation queries the response was YES. [2022-12-06 02:45:02,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337323 conditions, 24831 events. 16106/24831 cut-off events. For 27081/27081 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 174444 event pairs, 41 based on Foata normal form. 3/19386 useless extension candidates. Maximal degree in co-relation 254761. Up to 23272 conditions per place. [2022-12-06 02:45:02,681 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 5038 selfloop transitions, 788 changer transitions 329/6155 dead transitions. [2022-12-06 02:45:02,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 6155 transitions, 173540 flow [2022-12-06 02:45:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:45:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:45:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 164 transitions. [2022-12-06 02:45:02,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2733333333333333 [2022-12-06 02:45:02,684 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 202 predicate places. [2022-12-06 02:45:02,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:02,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 6155 transitions, 173540 flow [2022-12-06 02:45:02,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 6155 transitions, 173540 flow [2022-12-06 02:45:02,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:02,935 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:02,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 02:45:02,937 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 6155 transitions, 173540 flow [2022-12-06 02:45:02,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 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 02:45:02,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:02,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:02,944 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 02:45:03,143 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 02:45:03,143 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1675624188, now seen corresponding path program 7 times [2022-12-06 02:45:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986355969] [2022-12-06 02:45:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:03,722 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 02:45:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:03,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986355969] [2022-12-06 02:45:03,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986355969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:03,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363337084] [2022-12-06 02:45:03,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:45:03,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:03,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:03,732 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 02:45:03,735 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 02:45:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:03,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 02:45:03,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:03,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:03,867 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 18 treesize of output 16 [2022-12-06 02:45:03,889 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-12-06 02:45:03,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 60 [2022-12-06 02:45:03,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-12-06 02:45:03,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:03,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:03,920 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-12-06 02:45:03,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 95 [2022-12-06 02:45:03,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 02:45:03,950 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:45:03,951 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2022-12-06 02:45:03,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2022-12-06 02:45:03,999 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:45:03,999 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2022-12-06 02:45:04,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:45:04,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:45:04,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-12-06 02:45:04,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:04,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:04,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2022-12-06 02:45:04,042 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 9 treesize of output 7 [2022-12-06 02:45:04,124 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 02:45:04,174 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 02:45:04,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:45:04,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 02:45:04,401 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 02:45:04,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:04,658 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((~M~0 Int) (v_ArrVal_890 (Array Int Int)) (v_ArrVal_891 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_890) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_891))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 c_~B~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ .cse1 c_~B~0.offset)))) (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse2 c_~B~0.offset))))))) (not (< 0 c_~N~0))) is different from false [2022-12-06 02:45:04,691 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 02:45:04,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363337084] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:04,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:04,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 23 [2022-12-06 02:45:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902765698] [2022-12-06 02:45:04,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:04,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:45:04,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:04,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:45:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=455, Unknown=3, NotChecked=44, Total=600 [2022-12-06 02:45:04,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:45:04,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 6155 transitions, 173540 flow. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 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 02:45:04,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:04,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:45:04,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:38,170 INFO L130 PetriNetUnfolder]: 17073/26320 cut-off events. [2022-12-06 02:45:38,170 INFO L131 PetriNetUnfolder]: For 26779/26779 co-relation queries the response was YES. [2022-12-06 02:45:38,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384032 conditions, 26320 events. 17073/26320 cut-off events. For 26779/26779 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 186967 event pairs, 43 based on Foata normal form. 8/20540 useless extension candidates. Maximal degree in co-relation 293333. Up to 24695 conditions per place. [2022-12-06 02:45:38,475 INFO L137 encePairwiseOnDemand]: 13/30 looper letters, 4656 selfloop transitions, 1539 changer transitions 359/6554 dead transitions. [2022-12-06 02:45:38,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 6554 transitions, 197652 flow [2022-12-06 02:45:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:45:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:45:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 226 transitions. [2022-12-06 02:45:38,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3138888888888889 [2022-12-06 02:45:38,477 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 225 predicate places. [2022-12-06 02:45:38,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:38,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 6554 transitions, 197652 flow [2022-12-06 02:45:38,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 6554 transitions, 197652 flow [2022-12-06 02:45:38,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:38,938 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:38,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-06 02:45:38,939 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 6554 transitions, 197652 flow [2022-12-06 02:45:38,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 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 02:45:38,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:38,939 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:38,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 02:45:39,143 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 02:45:39,144 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1077294026, now seen corresponding path program 8 times [2022-12-06 02:45:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:39,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347127260] [2022-12-06 02:45:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:39,188 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 02:45:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:39,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347127260] [2022-12-06 02:45:39,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347127260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:39,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541984741] [2022-12-06 02:45:39,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:45:39,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:39,213 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 02:45:39,223 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 02:45:39,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:45:39,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:39,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:45:39,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:39,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:45:39,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541984741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:45:39,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:45:39,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 02:45:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135473861] [2022-12-06 02:45:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:45:39,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:45:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:45:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:45:39,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 02:45:39,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 6554 transitions, 197652 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 02:45:39,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:39,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 02:45:39,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:13,294 INFO L130 PetriNetUnfolder]: 13427/21297 cut-off events. [2022-12-06 02:46:13,294 INFO L131 PetriNetUnfolder]: For 27588/27588 co-relation queries the response was YES. [2022-12-06 02:46:13,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330640 conditions, 21297 events. 13427/21297 cut-off events. For 27588/27588 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 153855 event pairs, 43 based on Foata normal form. 0/17454 useless extension candidates. Maximal degree in co-relation 240038. Up to 19962 conditions per place. [2022-12-06 02:46:13,475 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 4864 selfloop transitions, 82 changer transitions 314/5391 dead transitions. [2022-12-06 02:46:13,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 5391 transitions, 173298 flow [2022-12-06 02:46:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:46:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:46:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 02:46:13,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 02:46:13,477 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 216 predicate places. [2022-12-06 02:46:13,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:13,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 5391 transitions, 173298 flow [2022-12-06 02:46:13,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 5391 transitions, 173298 flow [2022-12-06 02:46:13,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:13,724 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:13,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 02:46:13,725 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 5391 transitions, 173298 flow [2022-12-06 02:46:13,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 02:46:13,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:13,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:13,732 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 02:46:13,931 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 02:46:13,932 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1873245451, now seen corresponding path program 1 times [2022-12-06 02:46:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:13,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750772359] [2022-12-06 02:46:13,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:46:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750772359] [2022-12-06 02:46:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750772359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568539564] [2022-12-06 02:46:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:14,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:14,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:14,005 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 02:46:14,006 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 02:46:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:14,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:46:14,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:46:14,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:46:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568539564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:14,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:14,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 02:46:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255485882] [2022-12-06 02:46:14,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:14,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:46:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:46:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:46:14,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 02:46:14,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 5391 transitions, 173298 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:14,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:14,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 02:46:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:33,952 INFO L130 PetriNetUnfolder]: 13680/21653 cut-off events. [2022-12-06 02:46:33,953 INFO L131 PetriNetUnfolder]: For 35021/35021 co-relation queries the response was YES. [2022-12-06 02:46:33,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356396 conditions, 21653 events. 13680/21653 cut-off events. For 35021/35021 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 155923 event pairs, 31 based on Foata normal form. 0/17764 useless extension candidates. Maximal degree in co-relation 165766. Up to 20288 conditions per place. [2022-12-06 02:46:34,142 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 4943 selfloop transitions, 66 changer transitions 307/5447 dead transitions. [2022-12-06 02:46:34,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 5447 transitions, 185722 flow [2022-12-06 02:46:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:46:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:46:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 02:46:34,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 02:46:34,143 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 219 predicate places. [2022-12-06 02:46:34,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:34,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 5447 transitions, 185722 flow [2022-12-06 02:46:34,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 5447 transitions, 185722 flow [2022-12-06 02:46:34,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:34,377 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:34,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 02:46:34,377 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 5447 transitions, 185722 flow [2022-12-06 02:46:34,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:34,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:34,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:34,387 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 02:46:34,583 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 02:46:34,583 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1961553255, now seen corresponding path program 1 times [2022-12-06 02:46:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:34,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308404154] [2022-12-06 02:46:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:46:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308404154] [2022-12-06 02:46:34,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308404154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:46:34,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:46:34,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:46:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015839768] [2022-12-06 02:46:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:46:34,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:46:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:34,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:46:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:46:34,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:46:34,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 5447 transitions, 185722 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 02:46:34,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:34,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:46:34,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:44,142 INFO L130 PetriNetUnfolder]: 6419/10426 cut-off events. [2022-12-06 02:46:44,142 INFO L131 PetriNetUnfolder]: For 26524/26524 co-relation queries the response was YES. [2022-12-06 02:46:44,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175544 conditions, 10426 events. 6419/10426 cut-off events. For 26524/26524 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 69776 event pairs, 21 based on Foata normal form. 0/9206 useless extension candidates. Maximal degree in co-relation 65623. Up to 9161 conditions per place. [2022-12-06 02:46:44,221 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 2388 selfloop transitions, 104 changer transitions 480/3000 dead transitions. [2022-12-06 02:46:44,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 3000 transitions, 106584 flow [2022-12-06 02:46:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:46:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:46:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-06 02:46:44,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2022-12-06 02:46:44,223 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 207 predicate places. [2022-12-06 02:46:44,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:44,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 3000 transitions, 106584 flow [2022-12-06 02:46:44,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 3000 transitions, 106584 flow [2022-12-06 02:46:44,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:44,331 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:44,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 02:46:44,332 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 3000 transitions, 106584 flow [2022-12-06 02:46:44,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 02:46:44,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:44,332 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 02:46:44,332 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1940923300, now seen corresponding path program 9 times [2022-12-06 02:46:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252277872] [2022-12-06 02:46:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:46:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:44,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252277872] [2022-12-06 02:46:44,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252277872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:46:44,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:46:44,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:46:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314472973] [2022-12-06 02:46:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:46:44,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:46:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:46:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:46:44,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 02:46:44,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 3000 transitions, 106584 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 02:46:44,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:44,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 02:46:44,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:48,388 INFO L130 PetriNetUnfolder]: 4313/7219 cut-off events. [2022-12-06 02:46:48,389 INFO L131 PetriNetUnfolder]: For 29140/29140 co-relation queries the response was YES. [2022-12-06 02:46:48,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127628 conditions, 7219 events. 4313/7219 cut-off events. For 29140/29140 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47424 event pairs, 19 based on Foata normal form. 0/6613 useless extension candidates. Maximal degree in co-relation 58885. Up to 6276 conditions per place. [2022-12-06 02:46:48,440 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 713 selfloop transitions, 13 changer transitions 1338/2098 dead transitions. [2022-12-06 02:46:48,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 2098 transitions, 78280 flow [2022-12-06 02:46:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:46:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:46:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-06 02:46:48,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 02:46:48,442 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 203 predicate places. [2022-12-06 02:46:48,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:48,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 2098 transitions, 78280 flow [2022-12-06 02:46:48,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 2098 transitions, 78280 flow [2022-12-06 02:46:48,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:48,521 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:48,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 02:46:48,524 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 2098 transitions, 78280 flow [2022-12-06 02:46:48,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 02:46:48,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:48,524 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:48,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 02:46:48,524 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1986092197, now seen corresponding path program 2 times [2022-12-06 02:46:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:48,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215654668] [2022-12-06 02:46:48,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215654668] [2022-12-06 02:46:48,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215654668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820489612] [2022-12-06 02:46:48,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:46:48,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:48,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:48,608 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 02:46:48,636 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 02:46:48,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:46:48,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:46:48,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:46:48,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:48,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820489612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:48,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:48,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 02:46:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514841924] [2022-12-06 02:46:48,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:48,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:46:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:46:48,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:46:48,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:46:48,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 2098 transitions, 78280 flow. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:48,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:48,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:46:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:55,990 INFO L130 PetriNetUnfolder]: 10126/16052 cut-off events. [2022-12-06 02:46:55,991 INFO L131 PetriNetUnfolder]: For 42363/42363 co-relation queries the response was YES. [2022-12-06 02:46:56,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309006 conditions, 16052 events. 10126/16052 cut-off events. For 42363/42363 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 106494 event pairs, 31 based on Foata normal form. 0/13830 useless extension candidates. Maximal degree in co-relation 225829. Up to 14961 conditions per place. [2022-12-06 02:46:56,162 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 2649 selfloop transitions, 901 changer transitions 1338/4902 dead transitions. [2022-12-06 02:46:56,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 4902 transitions, 195072 flow [2022-12-06 02:46:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 02:46:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 02:46:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 434 transitions. [2022-12-06 02:46:56,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38070175438596493 [2022-12-06 02:46:56,168 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2022-12-06 02:46:56,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:56,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 4902 transitions, 195072 flow [2022-12-06 02:46:56,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 4902 transitions, 195072 flow [2022-12-06 02:46:56,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:56,426 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:56,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 02:46:56,428 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 4902 transitions, 195072 flow [2022-12-06 02:46:56,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:56,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:56,428 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:56,433 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 02:46:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:56,633 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1389723733, now seen corresponding path program 3 times [2022-12-06 02:46:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:56,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570576160] [2022-12-06 02:46:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:56,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:56,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570576160] [2022-12-06 02:46:56,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570576160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:56,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424646802] [2022-12-06 02:46:56,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:46:56,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:56,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:56,768 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 02:46:56,769 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 02:46:56,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:46:56,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:46:56,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:46:56,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:56,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:57,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424646802] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:57,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:57,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-12-06 02:46:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66330006] [2022-12-06 02:46:57,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:57,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:46:57,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:57,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:46:57,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:46:57,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:46:57,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 4902 transitions, 195072 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 02:46:57,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:57,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:46:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:47:22,753 INFO L130 PetriNetUnfolder]: 11185/17685 cut-off events. [2022-12-06 02:47:22,753 INFO L131 PetriNetUnfolder]: For 47703/47703 co-relation queries the response was YES. [2022-12-06 02:47:22,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358663 conditions, 17685 events. 11185/17685 cut-off events. For 47703/47703 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 118879 event pairs, 31 based on Foata normal form. 0/15291 useless extension candidates. Maximal degree in co-relation 269644. Up to 16562 conditions per place. [2022-12-06 02:47:22,937 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 3673 selfloop transitions, 987 changer transitions 1338/6012 dead transitions. [2022-12-06 02:47:22,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 6012 transitions, 251779 flow [2022-12-06 02:47:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:47:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:47:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2022-12-06 02:47:22,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2022-12-06 02:47:22,938 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 249 predicate places. [2022-12-06 02:47:22,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:47:22,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 6012 transitions, 251779 flow [2022-12-06 02:47:23,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 6012 transitions, 251779 flow [2022-12-06 02:47:23,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:47:23,259 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:47:23,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-06 02:47:23,260 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 6012 transitions, 251779 flow [2022-12-06 02:47:23,261 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 02:47:23,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:47:23,261 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:47:23,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 02:47:23,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:23,467 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:47:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:47:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1360750731, now seen corresponding path program 4 times [2022-12-06 02:47:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:47:23,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304883600] [2022-12-06 02:47:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:47:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:47:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:47:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:47:23,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304883600] [2022-12-06 02:47:23,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304883600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:47:23,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893857618] [2022-12-06 02:47:23,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:47:23,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:23,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:47:23,606 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 02:47:23,613 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 02:47:23,758 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:47:23,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:47:23,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:47:23,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:47:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:47:23,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:47:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:47:23,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893857618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:47:23,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:47:23,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-12-06 02:47:23,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392280677] [2022-12-06 02:47:23,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:47:23,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:47:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:47:23,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:47:23,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:47:23,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:47:23,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 6012 transitions, 251779 flow. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:47:23,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:47:23,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:47:23,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:47:52,031 INFO L130 PetriNetUnfolder]: 12987/20433 cut-off events. [2022-12-06 02:47:52,031 INFO L131 PetriNetUnfolder]: For 75385/75385 co-relation queries the response was YES. [2022-12-06 02:47:52,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436139 conditions, 20433 events. 12987/20433 cut-off events. For 75385/75385 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 139619 event pairs, 21 based on Foata normal form. 0/17705 useless extension candidates. Maximal degree in co-relation 329236. Up to 19310 conditions per place. [2022-12-06 02:47:52,231 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 4530 selfloop transitions, 1442 changer transitions 1484/7470 dead transitions. [2022-12-06 02:47:52,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 7470 transitions, 328412 flow [2022-12-06 02:47:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:47:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:47:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 204 transitions. [2022-12-06 02:47:52,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 02:47:52,232 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 264 predicate places. [2022-12-06 02:47:52,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:47:52,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 7470 transitions, 328412 flow [2022-12-06 02:47:52,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 7470 transitions, 328412 flow [2022-12-06 02:47:52,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:47:52,673 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:47:52,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 442 [2022-12-06 02:47:52,674 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 7470 transitions, 328412 flow [2022-12-06 02:47:52,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:47:52,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:47:52,674 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:47:52,679 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 02:47:52,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:52,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:47:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:47:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1309606311, now seen corresponding path program 5 times [2022-12-06 02:47:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:47:52,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191949163] [2022-12-06 02:47:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:47:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:47:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:47:52,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:47:52,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191949163] [2022-12-06 02:47:52,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191949163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:47:52,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142176186] [2022-12-06 02:47:52,965 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:47:52,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:52,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:47:52,967 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 02:47:52,968 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 02:47:53,092 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:47:53,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:47:53,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:47:53,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:47:53,174 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 02:47:53,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:47:53,234 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 02:47:53,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142176186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:47:53,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:47:53,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-12-06 02:47:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800271529] [2022-12-06 02:47:53,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:47:53,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:47:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:47:53,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:47:53,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:47:53,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:47:53,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 7470 transitions, 328412 flow. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:47:53,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:47:53,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:47:53,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:48:37,386 INFO L130 PetriNetUnfolder]: 14099/22103 cut-off events. [2022-12-06 02:48:37,386 INFO L131 PetriNetUnfolder]: For 80353/80353 co-relation queries the response was YES. [2022-12-06 02:48:37,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494792 conditions, 22103 events. 14099/22103 cut-off events. For 80353/80353 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 152184 event pairs, 14 based on Foata normal form. 0/19237 useless extension candidates. Maximal degree in co-relation 381993. Up to 20980 conditions per place. [2022-12-06 02:48:37,705 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 4657 selfloop transitions, 2631 changer transitions 1489/8777 dead transitions. [2022-12-06 02:48:37,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 8777 transitions, 402422 flow [2022-12-06 02:48:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-06 02:48:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-12-06 02:48:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 574 transitions. [2022-12-06 02:48:37,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2517543859649123 [2022-12-06 02:48:37,724 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 339 predicate places. [2022-12-06 02:48:37,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:48:37,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 8777 transitions, 402422 flow [2022-12-06 02:48:38,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 8777 transitions, 402422 flow [2022-12-06 02:48:38,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:48:38,104 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:48:38,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 02:48:38,107 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 8777 transitions, 402422 flow [2022-12-06 02:48:38,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:48:38,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:48:38,108 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:48:38,113 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 02:48:38,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:38,312 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:48:38,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:48:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1247333729, now seen corresponding path program 6 times [2022-12-06 02:48:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:48:38,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453908842] [2022-12-06 02:48:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:48:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:48:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:48:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:48:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:48:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453908842] [2022-12-06 02:48:38,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453908842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:48:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781571916] [2022-12-06 02:48:38,437 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:48:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:48:38,438 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 02:48:38,440 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 02:48:38,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:48:38,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:48:38,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:48:38,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:48:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:48:38,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:48:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:48:38,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781571916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:48:38,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:48:38,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-06 02:48:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484001237] [2022-12-06 02:48:38,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:48:38,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:48:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:48:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:48:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:48:38,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:48:38,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 8777 transitions, 402422 flow. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:48:38,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:48:38,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:48:38,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:49:40,575 INFO L130 PetriNetUnfolder]: 14066/22024 cut-off events. [2022-12-06 02:49:40,575 INFO L131 PetriNetUnfolder]: For 83964/83964 co-relation queries the response was YES. [2022-12-06 02:49:40,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514511 conditions, 22024 events. 14066/22024 cut-off events. For 83964/83964 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 151086 event pairs, 14 based on Foata normal form. 0/19188 useless extension candidates. Maximal degree in co-relation 397108. Up to 20901 conditions per place. [2022-12-06 02:49:40,780 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 5032 selfloop transitions, 2153 changer transitions 1489/8729 dead transitions. [2022-12-06 02:49:40,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 8729 transitions, 417504 flow [2022-12-06 02:49:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:49:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:49:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 196 transitions. [2022-12-06 02:49:40,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-06 02:49:40,782 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 354 predicate places. [2022-12-06 02:49:40,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:49:40,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 8729 transitions, 417504 flow [2022-12-06 02:49:41,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 387 places, 8729 transitions, 417504 flow [2022-12-06 02:49:41,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:49:41,186 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:49:41,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 406 [2022-12-06 02:49:41,188 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 8729 transitions, 417504 flow [2022-12-06 02:49:41,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:49:41,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:49:41,189 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:49:41,196 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 02:49:41,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:49:41,396 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:49:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:49:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2037236617, now seen corresponding path program 7 times [2022-12-06 02:49:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:49:41,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950665484] [2022-12-06 02:49:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:49:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:49:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:49:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:49:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:49:41,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950665484] [2022-12-06 02:49:41,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950665484] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:49:41,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683033373] [2022-12-06 02:49:41,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:49:41,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:49:41,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:49:41,509 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 02:49:41,510 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 02:49:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:49:41,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:49:41,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:49:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:49:41,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:49:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:49:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683033373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:49:41,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:49:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-12-06 02:49:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447910316] [2022-12-06 02:49:41,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:49:41,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:49:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:49:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:49:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:49:41,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:49:41,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 8729 transitions, 417504 flow. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:49:41,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:49:41,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:49:41,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:52,853 INFO L130 PetriNetUnfolder]: 19265/29779 cut-off events. [2022-12-06 02:50:52,854 INFO L131 PetriNetUnfolder]: For 95973/95973 co-relation queries the response was YES. [2022-12-06 02:50:52,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728501 conditions, 29779 events. 19265/29779 cut-off events. For 95973/95973 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 207084 event pairs, 20 based on Foata normal form. 0/25383 useless extension candidates. Maximal degree in co-relation 594154. Up to 28656 conditions per place. [2022-12-06 02:50:53,185 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 6877 selfloop transitions, 3103 changer transitions 1489/11524 dead transitions. [2022-12-06 02:50:53,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 11524 transitions, 575666 flow [2022-12-06 02:50:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 02:50:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 02:50:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 476 transitions. [2022-12-06 02:50:53,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38699186991869916 [2022-12-06 02:50:53,187 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 394 predicate places. [2022-12-06 02:50:53,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:53,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 427 places, 11524 transitions, 575666 flow [2022-12-06 02:50:53,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 427 places, 11524 transitions, 575666 flow [2022-12-06 02:50:53,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:53,894 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:53,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 02:50:53,895 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 11524 transitions, 575666 flow [2022-12-06 02:50:53,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:53,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:53,895 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:53,906 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 02:50:54,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:54,101 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:50:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -587183269, now seen corresponding path program 8 times [2022-12-06 02:50:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:54,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337581331] [2022-12-06 02:50:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:50:54,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337581331] [2022-12-06 02:50:54,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337581331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:50:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808272410] [2022-12-06 02:50:54,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:50:54,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:50:54,209 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 02:50:54,225 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 02:50:54,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:50:54,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:50:54,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:50:54,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:50:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:50:54,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:50:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:50:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808272410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:50:54,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:50:54,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-06 02:50:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573686818] [2022-12-06 02:50:54,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:50:54,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:50:54,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:54,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:50:54,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:50:54,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:50:54,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 11524 transitions, 575666 flow. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:54,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:54,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:50:54,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:52:34,493 INFO L130 PetriNetUnfolder]: 19333/29845 cut-off events. [2022-12-06 02:52:34,494 INFO L131 PetriNetUnfolder]: For 105392/105392 co-relation queries the response was YES. [2022-12-06 02:52:34,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759287 conditions, 29845 events. 19333/29845 cut-off events. For 105392/105392 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 207003 event pairs, 22 based on Foata normal form. 0/25473 useless extension candidates. Maximal degree in co-relation 619934. Up to 28722 conditions per place. [2022-12-06 02:52:34,930 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 7316 selfloop transitions, 2687 changer transitions 1489/11547 dead transitions. [2022-12-06 02:52:34,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 11547 transitions, 599757 flow [2022-12-06 02:52:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:52:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:52:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 176 transitions. [2022-12-06 02:52:34,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39111111111111113 [2022-12-06 02:52:34,932 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 408 predicate places. [2022-12-06 02:52:34,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:52:34,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 441 places, 11547 transitions, 599757 flow [2022-12-06 02:52:35,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 441 places, 11547 transitions, 599757 flow [2022-12-06 02:52:35,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:52:35,798 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:52:35,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 869 [2022-12-06 02:52:35,801 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 11547 transitions, 599757 flow [2022-12-06 02:52:35,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:52:35,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:52:35,801 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:52:35,822 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 02:52:36,010 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,SelfDestructingSolverStorable24 [2022-12-06 02:52:36,011 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:52:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:52:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1200363989, now seen corresponding path program 9 times [2022-12-06 02:52:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:52:36,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809694721] [2022-12-06 02:52:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:52:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:52:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:52:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:52:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:52:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809694721] [2022-12-06 02:52:36,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809694721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:52:36,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702421535] [2022-12-06 02:52:36,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:52:36,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:52:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:52:36,132 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 02:52:36,164 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 02:52:36,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:52:36,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:52:36,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:52:36,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:52:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:52:36,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:52:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:52:36,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702421535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:52:36,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:52:36,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-06 02:52:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531954740] [2022-12-06 02:52:36,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:52:36,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:52:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:52:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:52:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:52:36,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:52:36,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 11547 transitions, 599757 flow. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:52:36,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:52:36,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:52:36,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:26,589 INFO L130 PetriNetUnfolder]: 19333/29829 cut-off events. [2022-12-06 02:54:26,590 INFO L131 PetriNetUnfolder]: For 110465/110465 co-relation queries the response was YES. [2022-12-06 02:54:26,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788010 conditions, 29829 events. 19333/29829 cut-off events. For 110465/110465 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 206873 event pairs, 14 based on Foata normal form. 0/25487 useless extension candidates. Maximal degree in co-relation 643533. Up to 28706 conditions per place. [2022-12-06 02:54:26,956 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 6961 selfloop transitions, 3026 changer transitions 1489/11531 dead transitions. [2022-12-06 02:54:26,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 11531 transitions, 621831 flow [2022-12-06 02:54:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:54:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:54:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 166 transitions. [2022-12-06 02:54:26,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2022-12-06 02:54:26,957 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 420 predicate places. [2022-12-06 02:54:26,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:26,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 453 places, 11531 transitions, 621831 flow [2022-12-06 02:54:27,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 453 places, 11531 transitions, 621831 flow [2022-12-06 02:54:27,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:27,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:54:27,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 810 [2022-12-06 02:54:27,767 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 11531 transitions, 621831 flow [2022-12-06 02:54:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:27,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:27,768 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:54:27,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 02:54:27,974 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,SelfDestructingSolverStorable25 [2022-12-06 02:54:27,974 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:54:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -664897122, now seen corresponding path program 1 times [2022-12-06 02:54:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:27,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532804293] [2022-12-06 02:54:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:29,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:54:29,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532804293] [2022-12-06 02:54:29,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532804293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:29,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45054470] [2022-12-06 02:54:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:29,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:29,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:54:29,328 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 02:54:29,330 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 02:54:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:29,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-06 02:54:29,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:54:29,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:54:30,018 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-06 02:54:30,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2022-12-06 02:54:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:30,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:54:30,863 INFO L321 Elim1Store]: treesize reduction 20, result has 94.4 percent of original size [2022-12-06 02:54:30,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 350 [2022-12-06 02:54:44,590 INFO L321 Elim1Store]: treesize reduction 273, result has 23.5 percent of original size [2022-12-06 02:54:44,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 98 [2022-12-06 02:54:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:44,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45054470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:54:44,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:54:44,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2022-12-06 02:54:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652757882] [2022-12-06 02:54:44,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:54:44,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-06 02:54:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:54:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-06 02:54:44,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2022-12-06 02:54:44,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:54:44,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 11531 transitions, 621831 flow. Second operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 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 02:54:44,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:54:44,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:54:44,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:56:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-12-06 02:56:53,724 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 02:56:53,724 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:56:53,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:56:53,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:53,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 02:56:53,933 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. [2022-12-06 02:56:53,934 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:56:53,934 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:56:53,935 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:56:53,935 INFO L458 BasicCegarLoop]: Path program histogram: [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:53,938 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:56:53,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:56:53,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:56:53 BasicIcfg [2022-12-06 02:56:53,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:56:53,941 INFO L158 Benchmark]: Toolchain (without parser) took 834807.41ms. Allocated memory was 186.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 162.8MB in the beginning and 295.7MB in the end (delta: -132.9MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 02:56:53,941 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory was 162.6MB in the beginning and 162.5MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:56:53,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.83ms. Allocated memory is still 186.6MB. Free memory was 162.8MB in the beginning and 149.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:56:53,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.91ms. Allocated memory is still 186.6MB. Free memory was 149.2MB in the beginning and 147.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:56:53,941 INFO L158 Benchmark]: Boogie Preprocessor took 49.64ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:56:53,942 INFO L158 Benchmark]: RCFGBuilder took 806.42ms. Allocated memory is still 186.6MB. Free memory was 144.5MB in the beginning and 86.8MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-12-06 02:56:53,942 INFO L158 Benchmark]: TraceAbstraction took 833658.05ms. Allocated memory was 186.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 86.3MB in the beginning and 295.7MB in the end (delta: -209.4MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-06 02:56:53,943 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.10ms. Allocated memory is still 186.6MB. Free memory was 162.6MB in the beginning and 162.5MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.83ms. Allocated memory is still 186.6MB. Free memory was 162.8MB in the beginning and 149.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.91ms. Allocated memory is still 186.6MB. Free memory was 149.2MB in the beginning and 147.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.64ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 806.42ms. Allocated memory is still 186.6MB. Free memory was 144.5MB in the beginning and 86.8MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 833658.05ms. Allocated memory was 186.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 86.3MB in the beginning and 295.7MB in the end (delta: -209.4MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 160 PlacesBefore, 33 PlacesAfterwards, 166 TransitionsBefore, 28 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 96 TrivialYvCompositions, 31 ConcurrentYvCompositions, 11 ChoiceCompositions, 138 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 820, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 791, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 791, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 838, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1250, Positive conditional cache size: 0, Positive unconditional cache size: 1250, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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, 46 TransitionsBefore, 46 TransitionsAfterwards, 126 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, 38 PlacesBefore, 38 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 86 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, 45 PlacesBefore, 45 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 8 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, 49 PlacesBefore, 49 PlacesAfterwards, 144 TransitionsBefore, 144 TransitionsAfterwards, 8 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: 6.6s, 76 PlacesBefore, 70 PlacesAfterwards, 672 TransitionsBefore, 667 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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, 98 PlacesBefore, 96 PlacesAfterwards, 1419 TransitionsBefore, 1417 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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, 83 PlacesBefore, 83 PlacesAfterwards, 942 TransitionsBefore, 942 TransitionsAfterwards, 12 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, 2973 TransitionsBefore, 2973 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.1s, 130 PlacesBefore, 130 PlacesAfterwards, 3355 TransitionsBefore, 3355 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 147 PlacesBefore, 147 PlacesAfterwards, 3850 TransitionsBefore, 3850 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 194 PlacesBefore, 194 PlacesAfterwards, 5003 TransitionsBefore, 5003 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 224 PlacesBefore, 224 PlacesAfterwards, 6129 TransitionsBefore, 6129 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 235 PlacesBefore, 235 PlacesAfterwards, 6155 TransitionsBefore, 6155 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 258 PlacesBefore, 258 PlacesAfterwards, 6554 TransitionsBefore, 6554 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 249 PlacesBefore, 249 PlacesAfterwards, 5391 TransitionsBefore, 5391 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 252 PlacesBefore, 252 PlacesAfterwards, 5447 TransitionsBefore, 5447 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 240 PlacesBefore, 240 PlacesAfterwards, 3000 TransitionsBefore, 3000 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 236 PlacesBefore, 236 PlacesAfterwards, 2098 TransitionsBefore, 2098 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 273 PlacesBefore, 273 PlacesAfterwards, 4902 TransitionsBefore, 4902 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 282 PlacesBefore, 282 PlacesAfterwards, 6012 TransitionsBefore, 6012 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 297 PlacesBefore, 297 PlacesAfterwards, 7470 TransitionsBefore, 7470 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 372 PlacesBefore, 372 PlacesAfterwards, 8777 TransitionsBefore, 8777 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 387 PlacesBefore, 387 PlacesAfterwards, 8729 TransitionsBefore, 8729 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 427 PlacesBefore, 427 PlacesAfterwards, 11524 TransitionsBefore, 11524 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 441 PlacesBefore, 441 PlacesAfterwards, 11547 TransitionsBefore, 11547 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 453 PlacesBefore, 453 PlacesAfterwards, 11531 TransitionsBefore, 11531 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 106]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 197 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 833.5s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 767.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 5510 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5510 mSDsluCounter, 1232 SdHoareTripleChecker+Invalid, 15.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1453 IncrementalHoareTripleChecker+Unchecked, 1052 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26078 IncrementalHoareTripleChecker+Invalid, 28025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 180 mSDtfsCounter, 26078 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1701 GetRequests, 778 SyntacticMatches, 50 SemanticMatches, 872 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 15927 ImplicationChecksByTransitivity, 28.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621831occurred in iteration=26, InterpolantAutomatonStates: 520, 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.4s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1599 ConstructedInterpolants, 51 QuantifiedInterpolants, 18478 SizeOfPredicates, 397 NumberOfNonLiveVariables, 6677 ConjunctsInSsa, 806 ConjunctsInUnsatCore, 70 InterpolantComputations, 8 PerfectInterpolantSequences, 106/214 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