/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-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:55:23,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:55:23,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:55:23,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:55:23,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:55:23,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:55:23,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:55:23,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:55:23,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:55:23,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:55:23,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:55:23,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:55:23,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:55:23,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:55:23,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:55:23,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:55:23,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:55:23,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:55:23,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:55:23,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:55:23,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:55:23,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:55:23,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:55:23,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:55:23,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:55:23,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:55:23,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:55:23,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:55:23,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:55:23,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:55:23,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:55:23,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:55:23,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:55:23,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:55:23,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:55:23,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:55:23,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:55:23,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:55:23,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:55:23,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:55:23,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:55:23,613 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:55:23,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:55:23,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:55:23,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:55:23,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:55:23,632 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:55:23,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:55:23,632 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:55:23,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:55:23,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:55:23,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:55:23,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:55:23,634 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:55:23,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:55:23,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:55:23,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:55:23,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:55:23,987 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:55:23,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-12-06 02:55:25,060 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:55:25,274 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:55:25,274 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-12-06 02:55:25,283 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247cf9f65/4a9ed8ca665745569bfd679e2fa88ace/FLAG175941b4b [2022-12-06 02:55:25,306 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247cf9f65/4a9ed8ca665745569bfd679e2fa88ace [2022-12-06 02:55:25,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:55:25,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:55:25,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:55:25,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:55:25,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:55:25,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b34c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25, skipping insertion in model container [2022-12-06 02:55:25,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:55:25,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:55:25,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:55:25,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:55:25,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:55:25,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:55:25,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:55:25,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:55:25,456 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-max-array.wvr.c[2553,2566] [2022-12-06 02:55:25,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:55:25,478 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:55:25,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:55:25,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:55:25,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:55:25,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:55:25,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:55:25,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:55:25,514 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-max-array.wvr.c[2553,2566] [2022-12-06 02:55:25,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:55:25,533 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:55:25,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25 WrapperNode [2022-12-06 02:55:25,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:55:25,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:55:25,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:55:25,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:55:25,541 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:55:25" (1/1) ... [2022-12-06 02:55:25,558 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:55:25" (1/1) ... [2022-12-06 02:55:25,580 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-06 02:55:25,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:55:25,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:55:25,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:55:25,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:55:25,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,614 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:55:25,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:55:25,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:55:25,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:55:25,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (1/1) ... [2022-12-06 02:55:25,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:55:25,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:25,648 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:55:25,654 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:55:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:55:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:55:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:55:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:55:25,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:55:25,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:55:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:55:25,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:55:25,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:55:25,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:55:25,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:55:25,677 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:55:25,783 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:55:25,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:55:25,951 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:55:25,990 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:55:25,990 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 02:55:26,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:55:26 BoogieIcfgContainer [2022-12-06 02:55:26,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:55:26,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:55:26,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:55:26,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:55:26,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:55:25" (1/3) ... [2022-12-06 02:55:26,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf4777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:55:26, skipping insertion in model container [2022-12-06 02:55:26,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:55:25" (2/3) ... [2022-12-06 02:55:26,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf4777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:55:26, skipping insertion in model container [2022-12-06 02:55:26,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:55:26" (3/3) ... [2022-12-06 02:55:26,008 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-12-06 02:55:26,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:55:26,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:55:26,029 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:55:26,117 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:55:26,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 02:55:26,214 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-06 02:55:26,214 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:55:26,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 02:55:26,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 02:55:26,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-06 02:55:26,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:26,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 02:55:26,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-06 02:55:26,267 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-06 02:55:26,267 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:55:26,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 12/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 02:55:26,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 02:55:26,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 02:55:30,867 INFO L203 LiptonReduction]: Total number of compositions: 104 [2022-12-06 02:55:30,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:55:30,883 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;@6366c816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:55:30,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:55:30,888 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 02:55:30,888 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:55:30,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:30,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:55:30,889 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:55:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -833214972, now seen corresponding path program 1 times [2022-12-06 02:55:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461672867] [2022-12-06 02:55:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:31,333 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:55:31,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461672867] [2022-12-06 02:55:31,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461672867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:31,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:31,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:55:31,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754156835] [2022-12-06 02:55:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:31,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:55:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:55:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:55:31,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 02:55:31,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:31,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:31,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 02:55:31,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:31,456 INFO L130 PetriNetUnfolder]: 265/372 cut-off events. [2022-12-06 02:55:31,456 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 02:55:31,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 372 events. 265/372 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1070 event pairs, 132 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 606. Up to 368 conditions per place. [2022-12-06 02:55:31,459 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 02:55:31,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-06 02:55:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:55:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:55:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 02:55:31,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 02:55:31,470 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 02:55:31,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:31,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 114 flow [2022-12-06 02:55:31,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 114 flow [2022-12-06 02:55:31,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 02:55:32,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:55:32,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 988 [2022-12-06 02:55:32,458 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 110 flow [2022-12-06 02:55:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:32,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:32,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:55:32,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:55:32,459 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:55:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1604053399, now seen corresponding path program 1 times [2022-12-06 02:55:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:32,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060714488] [2022-12-06 02:55:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:32,537 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:55:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:32,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060714488] [2022-12-06 02:55:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060714488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:32,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:32,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:55:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737367041] [2022-12-06 02:55:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:32,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:55:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:55:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:55:32,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 02:55:32,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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:55:32,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:32,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 02:55:32,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:32,670 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][30], [30#L70-4true, thread3Thread1of1ForFork2InUse, 7#L94-4true, thread1Thread1of1ForFork0InUse, 66#L58-4true, 151#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), thread2Thread1of1ForFork1InUse, 97#L46-4true, 142#true]) [2022-12-06 02:55:32,670 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,670 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 02:55:32,670 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,670 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,671 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L58-4-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][31], [30#L70-4true, thread3Thread1of1ForFork2InUse, 7#L94-4true, 6#thread2EXITtrue, thread1Thread1of1ForFork0InUse, 151#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), 97#L46-4true, thread2Thread1of1ForFork1InUse, 142#true]) [2022-12-06 02:55:32,671 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 02:55:32,671 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 02:55:32,671 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 02:55:32,671 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 02:55:32,677 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][35], [30#L70-4true, thread3Thread1of1ForFork2InUse, 7#L94-4true, 66#L58-4true, thread1Thread1of1ForFork0InUse, 149#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 97#L46-4true, thread2Thread1of1ForFork1InUse, 142#true]) [2022-12-06 02:55:32,677 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,677 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,677 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,677 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,678 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L58-4-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][36], [30#L70-4true, thread3Thread1of1ForFork2InUse, 7#L94-4true, 6#thread2EXITtrue, thread1Thread1of1ForFork0InUse, 149#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 97#L46-4true, thread2Thread1of1ForFork1InUse, 142#true]) [2022-12-06 02:55:32,678 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2022-12-06 02:55:32,678 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 02:55:32,678 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 02:55:32,678 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 02:55:32,684 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][30], [30#L70-4true, 99#L95-1true, thread3Thread1of1ForFork2InUse, 66#L58-4true, thread1Thread1of1ForFork0InUse, 151#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), 97#L46-4true, thread2Thread1of1ForFork1InUse, 142#true]) [2022-12-06 02:55:32,684 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,684 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,684 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,684 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,684 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L58-4-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][31], [30#L70-4true, 99#L95-1true, thread3Thread1of1ForFork2InUse, 6#thread2EXITtrue, thread1Thread1of1ForFork0InUse, 151#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), 97#L46-4true, thread2Thread1of1ForFork1InUse, 142#true]) [2022-12-06 02:55:32,684 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,685 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:55:32,685 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,685 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:55:32,720 INFO L130 PetriNetUnfolder]: 645/909 cut-off events. [2022-12-06 02:55:32,720 INFO L131 PetriNetUnfolder]: For 203/221 co-relation queries the response was YES. [2022-12-06 02:55:32,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 909 events. 645/909 cut-off events. For 203/221 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3333 event pairs, 268 based on Foata normal form. 9/636 useless extension candidates. Maximal degree in co-relation 1137. Up to 865 conditions per place. [2022-12-06 02:55:32,728 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 57 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-06 02:55:32,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 65 transitions, 428 flow [2022-12-06 02:55:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:55:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:55:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 02:55:32,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2022-12-06 02:55:32,731 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 02:55:32,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:32,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 65 transitions, 428 flow [2022-12-06 02:55:32,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 65 transitions, 428 flow [2022-12-06 02:55:32,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 02:55:32,739 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:32,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:55:32,741 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 65 transitions, 428 flow [2022-12-06 02:55:32,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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:55:32,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:32,742 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:55:32,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:55:32,742 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:55:32,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 966856405, now seen corresponding path program 1 times [2022-12-06 02:55:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:32,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264782958] [2022-12-06 02:55:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264782958] [2022-12-06 02:55:32,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264782958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:32,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964968544] [2022-12-06 02:55:32,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:32,886 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:55:32,894 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:55:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:32,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:55:32,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:33,068 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:55:33,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:55:33,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964968544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:33,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:55:33,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-06 02:55:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826867020] [2022-12-06 02:55:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:33,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:55:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:33,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:55:33,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:55:33,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:33,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 65 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:33,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:33,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:33,311 INFO L130 PetriNetUnfolder]: 984/1437 cut-off events. [2022-12-06 02:55:33,311 INFO L131 PetriNetUnfolder]: For 842/863 co-relation queries the response was YES. [2022-12-06 02:55:33,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5559 conditions, 1437 events. 984/1437 cut-off events. For 842/863 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5717 event pairs, 250 based on Foata normal form. 21/1086 useless extension candidates. Maximal degree in co-relation 2264. Up to 1312 conditions per place. [2022-12-06 02:55:33,319 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 148 selfloop transitions, 15 changer transitions 0/165 dead transitions. [2022-12-06 02:55:33,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 165 transitions, 1410 flow [2022-12-06 02:55:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:55:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:55:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 02:55:33,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 02:55:33,329 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 02:55:33,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:33,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 165 transitions, 1410 flow [2022-12-06 02:55:33,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 165 transitions, 1410 flow [2022-12-06 02:55:33,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 02:55:33,340 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:33,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 02:55:33,341 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 165 transitions, 1410 flow [2022-12-06 02:55:33,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:33,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:33,341 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:55:33,349 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:55:33,546 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:55:33,547 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:55:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1601607483, now seen corresponding path program 2 times [2022-12-06 02:55:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:33,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663182676] [2022-12-06 02:55:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663182676] [2022-12-06 02:55:33,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663182676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:33,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:33,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:55:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348299198] [2022-12-06 02:55:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:55:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:55:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:55:33,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:33,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 165 transitions, 1410 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:33,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:33,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:33,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:34,032 INFO L130 PetriNetUnfolder]: 1509/2203 cut-off events. [2022-12-06 02:55:34,032 INFO L131 PetriNetUnfolder]: For 1345/1373 co-relation queries the response was YES. [2022-12-06 02:55:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10637 conditions, 2203 events. 1509/2203 cut-off events. For 1345/1373 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9680 event pairs, 220 based on Foata normal form. 28/1621 useless extension candidates. Maximal degree in co-relation 4240. Up to 2012 conditions per place. [2022-12-06 02:55:34,047 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 311 selfloop transitions, 42 changer transitions 0/355 dead transitions. [2022-12-06 02:55:34,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 355 transitions, 3688 flow [2022-12-06 02:55:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:55:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:55:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-12-06 02:55:34,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 02:55:34,052 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-06 02:55:34,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:34,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 355 transitions, 3688 flow [2022-12-06 02:55:34,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 355 transitions, 3688 flow [2022-12-06 02:55:34,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 02:55:34,063 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:34,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:55:34,066 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 355 transitions, 3688 flow [2022-12-06 02:55:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:34,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:34,066 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:55:34,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:55:34,067 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:55:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1346565239, now seen corresponding path program 3 times [2022-12-06 02:55:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:34,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775437883] [2022-12-06 02:55:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:34,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775437883] [2022-12-06 02:55:34,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775437883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:34,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:34,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:55:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240940627] [2022-12-06 02:55:34,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:34,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:55:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:55:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:55:34,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:34,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 355 transitions, 3688 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:34,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:34,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:34,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:34,568 INFO L130 PetriNetUnfolder]: 1697/2481 cut-off events. [2022-12-06 02:55:34,569 INFO L131 PetriNetUnfolder]: For 2136/2168 co-relation queries the response was YES. [2022-12-06 02:55:34,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14383 conditions, 2481 events. 1697/2481 cut-off events. For 2136/2168 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11132 event pairs, 230 based on Foata normal form. 32/1819 useless extension candidates. Maximal degree in co-relation 5790. Up to 2278 conditions per place. [2022-12-06 02:55:34,585 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 393 selfloop transitions, 56 changer transitions 0/451 dead transitions. [2022-12-06 02:55:34,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 451 transitions, 5588 flow [2022-12-06 02:55:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:55:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:55:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-12-06 02:55:34,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2022-12-06 02:55:34,588 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-06 02:55:34,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:34,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 451 transitions, 5588 flow [2022-12-06 02:55:34,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 451 transitions, 5588 flow [2022-12-06 02:55:34,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 02:55:34,603 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:34,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:55:34,604 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 451 transitions, 5588 flow [2022-12-06 02:55:34,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:34,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:34,604 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:55:34,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:55:34,604 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:55:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1370177009, now seen corresponding path program 4 times [2022-12-06 02:55:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:34,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109478476] [2022-12-06 02:55:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:34,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109478476] [2022-12-06 02:55:34,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109478476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:34,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:34,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:55:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510293192] [2022-12-06 02:55:34,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:34,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:55:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:55:34,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:55:34,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:34,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 451 transitions, 5588 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:34,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:34,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:34,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:35,171 INFO L130 PetriNetUnfolder]: 1695/2449 cut-off events. [2022-12-06 02:55:35,172 INFO L131 PetriNetUnfolder]: For 3547/3591 co-relation queries the response was YES. [2022-12-06 02:55:35,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 2449 events. 1695/2449 cut-off events. For 3547/3591 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10799 event pairs, 276 based on Foata normal form. 44/1815 useless extension candidates. Maximal degree in co-relation 6617. Up to 2256 conditions per place. [2022-12-06 02:55:35,193 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 371 selfloop transitions, 52 changer transitions 0/425 dead transitions. [2022-12-06 02:55:35,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 425 transitions, 6104 flow [2022-12-06 02:55:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:55:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:55:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-12-06 02:55:35,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2022-12-06 02:55:35,204 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2022-12-06 02:55:35,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:35,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 425 transitions, 6104 flow [2022-12-06 02:55:35,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 425 transitions, 6104 flow [2022-12-06 02:55:35,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 02:55:35,235 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:35,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 02:55:35,238 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 425 transitions, 6104 flow [2022-12-06 02:55:35,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:35,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:35,238 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:55:35,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:55:35,239 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:55:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1383433291, now seen corresponding path program 5 times [2022-12-06 02:55:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:35,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879456148] [2022-12-06 02:55:35,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:35,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879456148] [2022-12-06 02:55:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879456148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:35,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:35,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:55:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809731826] [2022-12-06 02:55:35,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:35,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:55:35,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:35,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:55:35,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:55:35,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:35,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 425 transitions, 6104 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:35,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:35,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:35,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:35,759 INFO L130 PetriNetUnfolder]: 1645/2401 cut-off events. [2022-12-06 02:55:35,759 INFO L131 PetriNetUnfolder]: For 3105/3137 co-relation queries the response was YES. [2022-12-06 02:55:35,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18511 conditions, 2401 events. 1645/2401 cut-off events. For 3105/3137 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10759 event pairs, 224 based on Foata normal form. 32/1787 useless extension candidates. Maximal degree in co-relation 7368. Up to 2196 conditions per place. [2022-12-06 02:55:35,777 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 363 selfloop transitions, 56 changer transitions 0/421 dead transitions. [2022-12-06 02:55:35,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 421 transitions, 6886 flow [2022-12-06 02:55:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:55:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:55:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-12-06 02:55:35,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2022-12-06 02:55:35,779 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2022-12-06 02:55:35,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:35,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 421 transitions, 6886 flow [2022-12-06 02:55:35,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 421 transitions, 6886 flow [2022-12-06 02:55:35,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 02:55:35,795 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:35,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 02:55:35,796 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 421 transitions, 6886 flow [2022-12-06 02:55:35,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:35,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:35,796 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:55:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:55:35,797 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:55:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1407045061, now seen corresponding path program 6 times [2022-12-06 02:55:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:35,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152198121] [2022-12-06 02:55:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152198121] [2022-12-06 02:55:35,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152198121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:35,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:35,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:55:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972734513] [2022-12-06 02:55:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:35,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:55:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:55:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:55:35,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:35,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 421 transitions, 6886 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:35,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:35,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:35,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:36,317 INFO L130 PetriNetUnfolder]: 1583/2313 cut-off events. [2022-12-06 02:55:36,318 INFO L131 PetriNetUnfolder]: For 2443/2463 co-relation queries the response was YES. [2022-12-06 02:55:36,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20031 conditions, 2313 events. 1583/2313 cut-off events. For 2443/2463 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10201 event pairs, 184 based on Foata normal form. 20/1727 useless extension candidates. Maximal degree in co-relation 7987. Up to 2112 conditions per place. [2022-12-06 02:55:36,334 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 341 selfloop transitions, 52 changer transitions 0/395 dead transitions. [2022-12-06 02:55:36,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 395 transitions, 7238 flow [2022-12-06 02:55:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:55:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:55:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2022-12-06 02:55:36,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2022-12-06 02:55:36,337 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2022-12-06 02:55:36,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:36,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 395 transitions, 7238 flow [2022-12-06 02:55:36,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 395 transitions, 7238 flow [2022-12-06 02:55:36,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 02:55:36,351 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:36,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:55:36,352 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 395 transitions, 7238 flow [2022-12-06 02:55:36,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:55:36,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:36,352 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:55:36,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:55:36,352 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:55:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash 605188555, now seen corresponding path program 1 times [2022-12-06 02:55:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:36,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460623851] [2022-12-06 02:55:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:36,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:36,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460623851] [2022-12-06 02:55:36,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460623851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:36,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:55:36,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:55:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746637069] [2022-12-06 02:55:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:36,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:55:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:55:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:55:36,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 02:55:36,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 395 transitions, 7238 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:36,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:36,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 02:55:36,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:36,786 INFO L130 PetriNetUnfolder]: 1226/1825 cut-off events. [2022-12-06 02:55:36,786 INFO L131 PetriNetUnfolder]: For 3349/3375 co-relation queries the response was YES. [2022-12-06 02:55:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17524 conditions, 1825 events. 1226/1825 cut-off events. For 3349/3375 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8100 event pairs, 132 based on Foata normal form. 56/1459 useless extension candidates. Maximal degree in co-relation 9018. Up to 1644 conditions per place. [2022-12-06 02:55:36,797 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 319 selfloop transitions, 5 changer transitions 35/361 dead transitions. [2022-12-06 02:55:36,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 361 transitions, 7329 flow [2022-12-06 02:55:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:55:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:55:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 02:55:36,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:55:36,798 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2022-12-06 02:55:36,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:36,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 361 transitions, 7329 flow [2022-12-06 02:55:36,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 361 transitions, 7329 flow [2022-12-06 02:55:36,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 02:55:38,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:55:38,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1920 [2022-12-06 02:55:38,719 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 360 transitions, 7309 flow [2022-12-06 02:55:38,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:38,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:38,719 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:55:38,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 02:55:38,719 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:55:38,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 14441103, now seen corresponding path program 1 times [2022-12-06 02:55:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:38,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874205436] [2022-12-06 02:55:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:39,365 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:55:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:39,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874205436] [2022-12-06 02:55:39,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874205436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:39,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126124940] [2022-12-06 02:55:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:39,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:39,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:39,367 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:55:39,369 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:55:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:39,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 02:55:39,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:39,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:39,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 84 [2022-12-06 02:55:39,944 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:55:39,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:40,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:40,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-06 02:55:40,162 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:55:40,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126124940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:40,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:40,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 16 [2022-12-06 02:55:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350120551] [2022-12-06 02:55:40,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:40,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:55:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:55:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:55:40,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:55:40,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 360 transitions, 7309 flow. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:40,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:40,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:55:40,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:41,684 INFO L130 PetriNetUnfolder]: 2500/3933 cut-off events. [2022-12-06 02:55:41,685 INFO L131 PetriNetUnfolder]: For 7146/7250 co-relation queries the response was YES. [2022-12-06 02:55:41,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41865 conditions, 3933 events. 2500/3933 cut-off events. For 7146/7250 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21710 event pairs, 20 based on Foata normal form. 48/3058 useless extension candidates. Maximal degree in co-relation 19924. Up to 3558 conditions per place. [2022-12-06 02:55:41,707 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 697 selfloop transitions, 378 changer transitions 189/1269 dead transitions. [2022-12-06 02:55:41,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 1269 transitions, 28324 flow [2022-12-06 02:55:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:55:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:55:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-12-06 02:55:41,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40695652173913044 [2022-12-06 02:55:41,710 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2022-12-06 02:55:41,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:41,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 1269 transitions, 28324 flow [2022-12-06 02:55:41,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 1269 transitions, 28324 flow [2022-12-06 02:55:41,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 02:55:41,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:41,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 02:55:41,744 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 1269 transitions, 28324 flow [2022-12-06 02:55:41,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:41,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:41,744 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:55:41,764 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:55:41,950 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,SelfDestructingSolverStorable9 [2022-12-06 02:55:41,950 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:55:41,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2070800589, now seen corresponding path program 2 times [2022-12-06 02:55:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:41,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204913457] [2022-12-06 02:55:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:42,495 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:55:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:42,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204913457] [2022-12-06 02:55:42,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204913457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:42,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996915446] [2022-12-06 02:55:42,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:55:42,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:42,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:42,497 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:55:42,499 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:55:42,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:55:42,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:42,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 02:55:42,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:42,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:55:42,598 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:55:42,638 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:55:42,677 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:55:42,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:55:42,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:42,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-06 02:55:42,927 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:55:42,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:43,232 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_319 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (or (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< c_~max2~0 (select .cse0 .cse1))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_319 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse1))) (or (not (< c_~max2~0 .cse2)) (= c_~max1~0 .cse2) (< c_~max1~0 (select .cse3 c_~A~0.offset)))))) (forall ((v_ArrVal_319 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (let ((.cse4 (select .cse5 c_~A~0.offset))) (or (= .cse4 c_~max2~0) (not (< c_~max1~0 .cse4)) (< c_~max2~0 (select .cse5 .cse1)))))) (forall ((v_ArrVal_319 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse6 (select .cse8 .cse1))) (or (not (< c_~max2~0 .cse6)) (not (< c_~max1~0 .cse7)) (= .cse7 .cse6))))))) is different from false [2022-12-06 02:55:43,299 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (= c_~max1~0 .cse0) (< c_~max1~0 (select .cse1 c_~A~0.offset)) (not (< c_~max2~0 .cse0)))))) (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (let ((.cse3 (select .cse4 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (< c_~max2~0 (select .cse4 .cse2)) (= c_~max2~0 .cse3))))) (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset)) (.cse6 (select .cse7 .cse2))) (or (not (< c_~max1~0 .cse5)) (= .cse6 .cse5) (not (< c_~max2~0 .cse6)))))) (or (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base))) (or (< c_~max2~0 (select .cse8 .cse2)) (< c_~max1~0 (select .cse8 c_~A~0.offset))))) (= c_~max1~0 c_~max2~0)))) is different from false [2022-12-06 02:55:43,336 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:55:43,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996915446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:43,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:43,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 02:55:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283770906] [2022-12-06 02:55:43,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:43,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:55:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:43,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:55:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2022-12-06 02:55:43,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:55:43,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 1269 transitions, 28324 flow. Second operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:43,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:43,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:55:43,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:44,755 INFO L130 PetriNetUnfolder]: 3077/4891 cut-off events. [2022-12-06 02:55:44,755 INFO L131 PetriNetUnfolder]: For 11222/11350 co-relation queries the response was YES. [2022-12-06 02:55:44,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56740 conditions, 4891 events. 3077/4891 cut-off events. For 11222/11350 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 28732 event pairs, 24 based on Foata normal form. 37/3831 useless extension candidates. Maximal degree in co-relation 31595. Up to 4430 conditions per place. [2022-12-06 02:55:44,787 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 1237 selfloop transitions, 155 changer transitions 292/1689 dead transitions. [2022-12-06 02:55:44,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 1689 transitions, 41203 flow [2022-12-06 02:55:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:55:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:55:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-12-06 02:55:44,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.496 [2022-12-06 02:55:44,790 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2022-12-06 02:55:44,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:44,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 1689 transitions, 41203 flow [2022-12-06 02:55:44,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 1689 transitions, 41203 flow [2022-12-06 02:55:44,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 02:55:44,913 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:44,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 02:55:44,915 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 1689 transitions, 41203 flow [2022-12-06 02:55:44,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:44,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:44,915 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:55:44,937 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:55:45,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:45,140 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:55:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1283594875, now seen corresponding path program 3 times [2022-12-06 02:55:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205180439] [2022-12-06 02:55:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:45,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:45,589 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:55:45,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:45,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205180439] [2022-12-06 02:55:45,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205180439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:45,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463546732] [2022-12-06 02:55:45,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:55:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:45,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:45,608 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:55:45,643 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:55:45,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:55:45,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:45,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 02:55:45,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:45,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:55:45,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-06 02:55:45,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:55:45,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:45,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-06 02:55:46,010 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:55:46,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:46,089 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_368) c_~A~0.base) .cse1))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_368 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_368) c_~A~0.base) .cse1)))))) is different from false [2022-12-06 02:55:46,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:46,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 107 [2022-12-06 02:55:46,116 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 72 treesize of output 66 [2022-12-06 02:55:46,120 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 66 treesize of output 54 [2022-12-06 02:55:46,210 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:55:46,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463546732] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:46,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:46,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:55:46,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822624961] [2022-12-06 02:55:46,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:46,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:55:46,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:46,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:55:46,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2022-12-06 02:55:46,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:55:46,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 1689 transitions, 41203 flow. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:46,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:46,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:55:46,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:48,055 INFO L130 PetriNetUnfolder]: 3525/5620 cut-off events. [2022-12-06 02:55:48,055 INFO L131 PetriNetUnfolder]: For 18234/18426 co-relation queries the response was YES. [2022-12-06 02:55:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70474 conditions, 5620 events. 3525/5620 cut-off events. For 18234/18426 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 34246 event pairs, 30 based on Foata normal form. 36/4414 useless extension candidates. Maximal degree in co-relation 36825. Up to 5095 conditions per place. [2022-12-06 02:55:48,090 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 1416 selfloop transitions, 210 changer transitions 376/2007 dead transitions. [2022-12-06 02:55:48,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 2007 transitions, 53047 flow [2022-12-06 02:55:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:55:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:55:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2022-12-06 02:55:48,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2022-12-06 02:55:48,092 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2022-12-06 02:55:48,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:48,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 2007 transitions, 53047 flow [2022-12-06 02:55:48,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 2007 transitions, 53047 flow [2022-12-06 02:55:48,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 02:55:48,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:48,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 02:55:48,150 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 2007 transitions, 53047 flow [2022-12-06 02:55:48,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:48,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:48,151 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:55:48,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:55:48,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:48,356 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:55:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2006126687, now seen corresponding path program 4 times [2022-12-06 02:55:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:48,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694244430] [2022-12-06 02:55:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:49,179 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:55:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694244430] [2022-12-06 02:55:49,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694244430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536241744] [2022-12-06 02:55:49,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:55:49,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:49,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:49,181 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:55:49,183 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:55:49,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:55:49,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:49,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 02:55:49,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:49,504 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:55:49,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 69 [2022-12-06 02:55:49,596 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:55:49,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:49,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:49,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-06 02:55:49,800 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:55:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536241744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:49,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:49,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2022-12-06 02:55:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449731878] [2022-12-06 02:55:49,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:49,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:55:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:49,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:55:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:55:49,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:55:49,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 2007 transitions, 53047 flow. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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:55:49,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:49,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:55:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:53,830 INFO L130 PetriNetUnfolder]: 5214/8656 cut-off events. [2022-12-06 02:55:53,830 INFO L131 PetriNetUnfolder]: For 14688/14688 co-relation queries the response was YES. [2022-12-06 02:55:53,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118242 conditions, 8656 events. 5214/8656 cut-off events. For 14688/14688 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 59143 event pairs, 12 based on Foata normal form. 6/6866 useless extension candidates. Maximal degree in co-relation 63153. Up to 8037 conditions per place. [2022-12-06 02:55:53,894 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 2321 selfloop transitions, 782 changer transitions 706/3809 dead transitions. [2022-12-06 02:55:53,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 3809 transitions, 108327 flow [2022-12-06 02:55:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:55:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:55:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 282 transitions. [2022-12-06 02:55:53,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3418181818181818 [2022-12-06 02:55:53,898 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2022-12-06 02:55:53,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:53,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 3809 transitions, 108327 flow [2022-12-06 02:55:54,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 3809 transitions, 108327 flow [2022-12-06 02:55:54,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:55:54,021 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:54,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 02:55:54,022 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 3809 transitions, 108327 flow [2022-12-06 02:55:54,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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:55:54,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:54,024 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:55:54,029 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:55:54,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:55:54,229 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:55:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2139764157, now seen corresponding path program 5 times [2022-12-06 02:55:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:54,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927580357] [2022-12-06 02:55:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:54,735 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:55:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:54,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927580357] [2022-12-06 02:55:54,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927580357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:54,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850826399] [2022-12-06 02:55:54,736 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:55:54,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:54,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:54,744 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:55:54,771 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:55:54,843 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:55:54,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:54,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 02:55:54,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:55,072 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:55:55,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-12-06 02:55:55,148 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:55:55,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:55,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:55,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-06 02:55:55,370 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:55:55,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850826399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:55,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:55,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 17 [2022-12-06 02:55:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772838564] [2022-12-06 02:55:55,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:55,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:55:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:55:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:55:55,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:55:55,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 3809 transitions, 108327 flow. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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:55:55,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:55,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:55:55,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:01,622 INFO L130 PetriNetUnfolder]: 5672/9334 cut-off events. [2022-12-06 02:56:01,623 INFO L131 PetriNetUnfolder]: For 15602/15602 co-relation queries the response was YES. [2022-12-06 02:56:01,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136706 conditions, 9334 events. 5672/9334 cut-off events. For 15602/15602 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 63623 event pairs, 12 based on Foata normal form. 7/7406 useless extension candidates. Maximal degree in co-relation 76856. Up to 8641 conditions per place. [2022-12-06 02:56:01,680 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 2995 selfloop transitions, 428 changer transitions 725/4148 dead transitions. [2022-12-06 02:56:01,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 4148 transitions, 125854 flow [2022-12-06 02:56:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:56:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:56:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 272 transitions. [2022-12-06 02:56:01,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3296969696969697 [2022-12-06 02:56:01,682 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2022-12-06 02:56:01,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:01,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 4148 transitions, 125854 flow [2022-12-06 02:56:01,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 4148 transitions, 125854 flow [2022-12-06 02:56:01,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:01,809 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:01,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 02:56:01,810 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 4148 transitions, 125854 flow [2022-12-06 02:56:01,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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:56:01,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:01,810 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:56:01,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:02,017 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:56:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -6640259, now seen corresponding path program 6 times [2022-12-06 02:56:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:02,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259568575] [2022-12-06 02:56:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:02,337 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:56:02,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:02,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259568575] [2022-12-06 02:56:02,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259568575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:02,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189421963] [2022-12-06 02:56:02,337 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:56:02,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:02,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:02,338 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:56:02,341 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:56:02,414 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:56:02,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:56:02,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 02:56:02,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:02,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:56:02,439 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:56:02,471 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:56:02,502 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:56:02,661 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:56:02,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-12-06 02:56:02,740 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:56:02,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:03,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_517 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= c_~max2~0 .cse0) (< c_~max2~0 (select .cse1 .cse2)) (not (< c_~max1~0 .cse0)))))) (forall ((v_ArrVal_517 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (let ((.cse3 (select .cse5 .cse2)) (.cse4 (select .cse5 c_~A~0.offset))) (or (not (< c_~max2~0 .cse3)) (not (< c_~max1~0 .cse4)) (= .cse3 .cse4))))) (forall ((v_ArrVal_517 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse2))) (or (not (< c_~max2~0 .cse6)) (< c_~max1~0 (select .cse7 c_~A~0.offset)) (= c_~max1~0 .cse6))))) (or (forall ((v_ArrVal_517 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (or (< c_~max1~0 (select .cse8 c_~A~0.offset)) (< c_~max2~0 (select .cse8 .cse2))))) (= c_~max1~0 c_~max2~0)))) is different from false [2022-12-06 02:56:03,076 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (or (< c_~max2~0 (select .cse0 .cse1)) (< c_~max1~0 (select .cse0 c_~A~0.offset)))))) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (let ((.cse3 (select .cse2 c_~A~0.offset))) (or (< c_~max2~0 (select .cse2 .cse1)) (not (< c_~max1~0 .cse3)) (= .cse3 c_~max2~0))))) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse1)) (.cse5 (select .cse6 c_~A~0.offset))) (or (= .cse4 .cse5) (not (< c_~max2~0 .cse4)) (not (< c_~max1~0 .cse5)))))) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse1))) (or (not (< c_~max2~0 .cse7)) (= c_~max1~0 .cse7) (< c_~max1~0 (select .cse8 c_~A~0.offset)))))))) is different from false [2022-12-06 02:56:03,107 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:56:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189421963] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:03,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:03,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 02:56:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865948892] [2022-12-06 02:56:03,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:03,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:56:03,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:56:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=277, Unknown=2, NotChecked=70, Total=420 [2022-12-06 02:56:03,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:56:03,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 4148 transitions, 125854 flow. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 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:56:03,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:03,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:56:03,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:09,977 INFO L130 PetriNetUnfolder]: 5724/9450 cut-off events. [2022-12-06 02:56:09,977 INFO L131 PetriNetUnfolder]: For 18410/18410 co-relation queries the response was YES. [2022-12-06 02:56:09,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147287 conditions, 9450 events. 5724/9450 cut-off events. For 18410/18410 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 64845 event pairs, 12 based on Foata normal form. 1/7496 useless extension candidates. Maximal degree in co-relation 83153. Up to 8745 conditions per place. [2022-12-06 02:56:10,060 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 3109 selfloop transitions, 295 changer transitions 770/4221 dead transitions. [2022-12-06 02:56:10,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 4221 transitions, 136440 flow [2022-12-06 02:56:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:56:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:56:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2022-12-06 02:56:10,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 02:56:10,062 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2022-12-06 02:56:10,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:10,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 4221 transitions, 136440 flow [2022-12-06 02:56:10,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 4221 transitions, 136440 flow [2022-12-06 02:56:10,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:10,199 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:10,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 02:56:10,200 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 4221 transitions, 136440 flow [2022-12-06 02:56:10,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 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:56:10,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:10,201 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:56:10,214 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:56:10,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:10,406 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:56:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash 928369653, now seen corresponding path program 7 times [2022-12-06 02:56:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071018562] [2022-12-06 02:56:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:10,864 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:56:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:10,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071018562] [2022-12-06 02:56:10,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071018562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:10,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734093781] [2022-12-06 02:56:10,864 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:56:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:10,866 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:56:10,898 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:56:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 02:56:10,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:10,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:56:10,988 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:56:11,015 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:56:11,041 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:56:11,292 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:56:11,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 72 [2022-12-06 02:56:11,405 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:56:11,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:11,948 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (forall ((~M~0 Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< c_~max2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_572 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (let ((.cse1 (select .cse3 c_~A~0.offset))) (or (not (< c_~max1~0 .cse1)) (forall ((~M~0 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse2)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (= .cse2 .cse1)))))))) (forall ((v_ArrVal_572 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (or (< c_~max1~0 (select .cse4 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (= .cse5 c_~max1~0) (< (+ ~M~0 1) c_~N~0))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_572 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (= c_~max2~0 .cse6) (not (< c_~max1~0 .cse6)) (< c_~max2~0 (select .cse7 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-12-06 02:56:12,059 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (= c_~max1~0 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (or (< c_~max2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse1)) (= c_~max1~0 .cse1) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse2 c_~A~0.offset))))) (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (let ((.cse4 (select .cse5 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse3)) (= .cse3 .cse4) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse4)))))) (forall ((~M~0 Int) (v_ArrVal_571 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (forall ((v_ArrVal_572 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_572) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (< c_~max2~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse7 c_~max2~0) (not (< c_~max1~0 .cse7)))))) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-12-06 02:56:12,115 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:56:12,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734093781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:12,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:12,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-12-06 02:56:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32276716] [2022-12-06 02:56:12,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:12,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:56:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:56:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=325, Unknown=2, NotChecked=78, Total=506 [2022-12-06 02:56:12,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:56:12,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 4221 transitions, 136440 flow. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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:56:12,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:12,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:56:12,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:21,202 INFO L130 PetriNetUnfolder]: 5977/9932 cut-off events. [2022-12-06 02:56:21,203 INFO L131 PetriNetUnfolder]: For 22896/22896 co-relation queries the response was YES. [2022-12-06 02:56:21,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163973 conditions, 9932 events. 5977/9932 cut-off events. For 22896/22896 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 69303 event pairs, 12 based on Foata normal form. 4/7887 useless extension candidates. Maximal degree in co-relation 93206. Up to 9165 conditions per place. [2022-12-06 02:56:21,269 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 2738 selfloop transitions, 847 changer transitions 860/4492 dead transitions. [2022-12-06 02:56:21,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 4492 transitions, 154127 flow [2022-12-06 02:56:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:56:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:56:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 215 transitions. [2022-12-06 02:56:21,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 02:56:21,272 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2022-12-06 02:56:21,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:21,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 4492 transitions, 154127 flow [2022-12-06 02:56:21,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 4492 transitions, 154127 flow [2022-12-06 02:56:21,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:21,390 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:21,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 02:56:21,391 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 4492 transitions, 154127 flow [2022-12-06 02:56:21,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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:56:21,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:21,391 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:56:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:21,596 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,SelfDestructingSolverStorable15 [2022-12-06 02:56:21,597 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:56:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 633585999, now seen corresponding path program 8 times [2022-12-06 02:56:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160143795] [2022-12-06 02:56:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:56:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:22,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160143795] [2022-12-06 02:56:22,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160143795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:22,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36640619] [2022-12-06 02:56:22,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:56:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:22,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:22,120 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:56:22,122 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:56:22,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:56:22,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:56:22,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 02:56:22,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:22,399 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:56:22,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-12-06 02:56:22,473 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:56:22,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:22,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:56:22,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 49 [2022-12-06 02:56:22,607 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:56:22,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36640619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:22,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:22,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 19 [2022-12-06 02:56:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945021834] [2022-12-06 02:56:22,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:22,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:56:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:56:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:56:22,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:56:22,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 4492 transitions, 154127 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:56:22,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:22,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:56:22,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:32,401 INFO L130 PetriNetUnfolder]: 6124/10174 cut-off events. [2022-12-06 02:56:32,401 INFO L131 PetriNetUnfolder]: For 23603/23603 co-relation queries the response was YES. [2022-12-06 02:56:32,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178160 conditions, 10174 events. 6124/10174 cut-off events. For 23603/23603 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 71379 event pairs, 12 based on Foata normal form. 2/8075 useless extension candidates. Maximal degree in co-relation 102898. Up to 9389 conditions per place. [2022-12-06 02:56:32,489 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 3406 selfloop transitions, 294 changer transitions 949/4649 dead transitions. [2022-12-06 02:56:32,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 4649 transitions, 168639 flow [2022-12-06 02:56:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:56:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:56:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-12-06 02:56:32,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3175 [2022-12-06 02:56:32,491 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2022-12-06 02:56:32,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:32,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 4649 transitions, 168639 flow [2022-12-06 02:56:32,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 4649 transitions, 168639 flow [2022-12-06 02:56:32,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:32,649 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:32,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 02:56:32,650 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 4649 transitions, 168639 flow [2022-12-06 02:56:32,650 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:56:32,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:32,650 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:56:32,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 02:56:32,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:56:32,856 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:56:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash -536795615, now seen corresponding path program 9 times [2022-12-06 02:56:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:32,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852500826] [2022-12-06 02:56:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:33,419 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:56:33,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:33,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852500826] [2022-12-06 02:56:33,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852500826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396324557] [2022-12-06 02:56:33,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:56:33,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:33,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:33,421 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:56:33,463 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:56:33,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:56:33,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:56:33,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 02:56:33,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:33,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:56:33,669 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:56:33,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:56:33,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-06 02:56:33,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:56:33,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-06 02:56:34,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:56:34,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:56:34,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-06 02:56:34,035 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:56:34,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:34,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_673 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~A~0.base) .cse1))) (or (= .cse0 c_~max1~0) (not (< c_~max2~0 .cse0))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_673 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~A~0.base) .cse1)))))) is different from false [2022-12-06 02:56:34,472 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:56:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396324557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:34,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:34,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-12-06 02:56:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581741877] [2022-12-06 02:56:34,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:56:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:56:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=414, Unknown=15, NotChecked=42, Total=552 [2022-12-06 02:56:34,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:56:34,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 4649 transitions, 168639 flow. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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:56:34,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:34,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:56:34,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:44,839 INFO L130 PetriNetUnfolder]: 6957/11559 cut-off events. [2022-12-06 02:56:44,839 INFO L131 PetriNetUnfolder]: For 24275/24275 co-relation queries the response was YES. [2022-12-06 02:56:44,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214297 conditions, 11559 events. 6957/11559 cut-off events. For 24275/24275 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 82971 event pairs, 12 based on Foata normal form. 6/9308 useless extension candidates. Maximal degree in co-relation 132589. Up to 10714 conditions per place. [2022-12-06 02:56:44,934 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 3739 selfloop transitions, 582 changer transitions 1007/5328 dead transitions. [2022-12-06 02:56:44,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 5328 transitions, 203977 flow [2022-12-06 02:56:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:56:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:56:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2022-12-06 02:56:44,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4276923076923077 [2022-12-06 02:56:44,936 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2022-12-06 02:56:44,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:44,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 5328 transitions, 203977 flow [2022-12-06 02:56:45,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 5328 transitions, 203977 flow [2022-12-06 02:56:45,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:45,110 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:45,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 02:56:45,111 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 5328 transitions, 203977 flow [2022-12-06 02:56:45,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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:56:45,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:45,111 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:56:45,118 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:56:45,316 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,SelfDestructingSolverStorable17 [2022-12-06 02:56:45,316 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:56:45,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 642749440, now seen corresponding path program 1 times [2022-12-06 02:56:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:45,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372345930] [2022-12-06 02:56:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:45,390 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:56:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372345930] [2022-12-06 02:56:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372345930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164449543] [2022-12-06 02:56:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:45,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:45,392 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:56:45,395 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:56:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:45,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:56:45,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:45,500 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:56:45,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:45,520 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:56:45,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164449543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:45,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:45,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 02:56:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120844517] [2022-12-06 02:56:45,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:56:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:56:45,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:56:45,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 02:56:45,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 5328 transitions, 203977 flow. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:45,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:45,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 02:56:45,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:55,610 INFO L130 PetriNetUnfolder]: 7232/11968 cut-off events. [2022-12-06 02:56:55,610 INFO L131 PetriNetUnfolder]: For 31361/31361 co-relation queries the response was YES. [2022-12-06 02:56:55,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232629 conditions, 11968 events. 7232/11968 cut-off events. For 31361/31361 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 85474 event pairs, 14 based on Foata normal form. 0/9643 useless extension candidates. Maximal degree in co-relation 138918. Up to 11107 conditions per place. [2022-12-06 02:56:55,849 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 4211 selfloop transitions, 84 changer transitions 1007/5501 dead transitions. [2022-12-06 02:56:55,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 5501 transitions, 221142 flow [2022-12-06 02:56:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:56:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:56:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 02:56:55,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 02:56:55,850 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2022-12-06 02:56:55,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:55,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 5501 transitions, 221142 flow [2022-12-06 02:56:56,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 5501 transitions, 221142 flow [2022-12-06 02:56:56,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:56,040 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:56,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 02:56:56,041 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 5501 transitions, 221142 flow [2022-12-06 02:56:56,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:56,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:56,041 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] [2022-12-06 02:56:56,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:56,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:56,243 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:56:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1015086047, now seen corresponding path program 10 times [2022-12-06 02:56:56,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:56,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369125906] [2022-12-06 02:56:56,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:56,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:56:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:56,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369125906] [2022-12-06 02:56:56,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369125906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:56,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469184235] [2022-12-06 02:56:56,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:56:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:56,315 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:56:56,373 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:56:56,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:56:56,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:56:56,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:56:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:56,485 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:56:56,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:56,532 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:56:56,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469184235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:56,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:56,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 16 [2022-12-06 02:56:56,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215299007] [2022-12-06 02:56:56,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:56,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:56:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:56:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:56:56,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:56:56,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 5501 transitions, 221142 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 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:56:56,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:56,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:56:56,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:14,169 INFO L130 PetriNetUnfolder]: 5182/8729 cut-off events. [2022-12-06 02:57:14,169 INFO L131 PetriNetUnfolder]: For 24492/24492 co-relation queries the response was YES. [2022-12-06 02:57:14,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177930 conditions, 8729 events. 5182/8729 cut-off events. For 24492/24492 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 60595 event pairs, 14 based on Foata normal form. 0/7439 useless extension candidates. Maximal degree in co-relation 87061. Up to 8046 conditions per place. [2022-12-06 02:57:14,250 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 2940 selfloop transitions, 372 changer transitions 747/4059 dead transitions. [2022-12-06 02:57:14,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 4059 transitions, 170665 flow [2022-12-06 02:57:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:57:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:57:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 208 transitions. [2022-12-06 02:57:14,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3328 [2022-12-06 02:57:14,252 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2022-12-06 02:57:14,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:14,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 4059 transitions, 170665 flow [2022-12-06 02:57:14,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 4059 transitions, 170665 flow [2022-12-06 02:57:14,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:14,492 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:14,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 02:57:14,493 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 4059 transitions, 170665 flow [2022-12-06 02:57:14,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 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:57:14,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:14,493 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] [2022-12-06 02:57:14,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 02:57:14,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:14,697 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:57:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1234645852, now seen corresponding path program 11 times [2022-12-06 02:57:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:14,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406406105] [2022-12-06 02:57:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:57:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:14,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406406105] [2022-12-06 02:57:14,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406406105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:57:14,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:57:14,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:57:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707224504] [2022-12-06 02:57:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:57:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:57:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:57:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:57:14,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 02:57:14,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 4059 transitions, 170665 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:57:14,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:14,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 02:57:14,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:22,203 INFO L130 PetriNetUnfolder]: 4288/7431 cut-off events. [2022-12-06 02:57:22,204 INFO L131 PetriNetUnfolder]: For 29436/29436 co-relation queries the response was YES. [2022-12-06 02:57:22,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158401 conditions, 7431 events. 4288/7431 cut-off events. For 29436/29436 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 52283 event pairs, 14 based on Foata normal form. 0/6643 useless extension candidates. Maximal degree in co-relation 67768. Up to 6866 conditions per place. [2022-12-06 02:57:22,243 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 1242 selfloop transitions, 59 changer transitions 2212/3553 dead transitions. [2022-12-06 02:57:22,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 3553 transitions, 156559 flow [2022-12-06 02:57:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:57:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:57:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 02:57:22,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2022-12-06 02:57:22,244 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2022-12-06 02:57:22,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:22,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 3553 transitions, 156559 flow [2022-12-06 02:57:22,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 3553 transitions, 156559 flow [2022-12-06 02:57:22,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:22,422 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:22,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 02:57:22,423 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 3553 transitions, 156559 flow [2022-12-06 02:57:22,423 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:57:22,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:22,423 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:57:22,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 02:57:22,423 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:57:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1206897468, now seen corresponding path program 2 times [2022-12-06 02:57:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:22,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404963681] [2022-12-06 02:57:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:22,500 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:57:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:22,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404963681] [2022-12-06 02:57:22,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404963681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:22,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646340062] [2022-12-06 02:57:22,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:57:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:22,516 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:57:22,522 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:57:22,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 02:57:22,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:22,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:57:22,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 02:57:22,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:57:22,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646340062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:57:22,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:57:22,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-06 02:57:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236850464] [2022-12-06 02:57:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:57:22,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:57:22,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:57:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:57:22,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 02:57:22,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 3553 transitions, 156559 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:57:22,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:22,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 02:57:22,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:26,877 INFO L130 PetriNetUnfolder]: 3754/6559 cut-off events. [2022-12-06 02:57:26,878 INFO L131 PetriNetUnfolder]: For 32180/32180 co-relation queries the response was YES. [2022-12-06 02:57:26,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145716 conditions, 6559 events. 3754/6559 cut-off events. For 32180/32180 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 45689 event pairs, 14 based on Foata normal form. 0/6063 useless extension candidates. Maximal degree in co-relation 67016. Up to 6050 conditions per place. [2022-12-06 02:57:26,914 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 865 selfloop transitions, 110 changer transitions 2108/3114 dead transitions. [2022-12-06 02:57:26,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 3114 transitions, 143415 flow [2022-12-06 02:57:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:57:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:57:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 02:57:26,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-06 02:57:26,915 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2022-12-06 02:57:26,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:26,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 3114 transitions, 143415 flow [2022-12-06 02:57:27,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 3114 transitions, 143415 flow [2022-12-06 02:57:27,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:27,032 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:27,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 02:57:27,035 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 3114 transitions, 143415 flow [2022-12-06 02:57:27,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:57:27,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:27,036 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:57:27,040 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:57:27,236 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,SelfDestructingSolverStorable21 [2022-12-06 02:57:27,236 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:57:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2034063497, now seen corresponding path program 1 times [2022-12-06 02:57:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:27,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702648150] [2022-12-06 02:57:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:27,366 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:57:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:27,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702648150] [2022-12-06 02:57:27,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702648150] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:27,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026455796] [2022-12-06 02:57:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:27,384 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:57:27,415 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:57:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:27,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:57:27,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:27,557 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:57:27,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:27,611 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:57:27,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026455796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:27,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:27,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 02:57:27,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922317970] [2022-12-06 02:57:27,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:27,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:57:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:57:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:57:27,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:57:27,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 3114 transitions, 143415 flow. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:57:27,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:27,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:57:27,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:32,894 INFO L130 PetriNetUnfolder]: 4071/7100 cut-off events. [2022-12-06 02:57:32,895 INFO L131 PetriNetUnfolder]: For 34735/34735 co-relation queries the response was YES. [2022-12-06 02:57:32,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165031 conditions, 7100 events. 4071/7100 cut-off events. For 34735/34735 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 49770 event pairs, 14 based on Foata normal form. 0/6472 useless extension candidates. Maximal degree in co-relation 70020. Up to 6575 conditions per place. [2022-12-06 02:57:32,935 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 1033 selfloop transitions, 257 changer transitions 2108/3409 dead transitions. [2022-12-06 02:57:32,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 3409 transitions, 163916 flow [2022-12-06 02:57:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:57:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:57:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2022-12-06 02:57:32,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 02:57:32,937 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 02:57:32,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:32,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 3409 transitions, 163916 flow [2022-12-06 02:57:33,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 3409 transitions, 163916 flow [2022-12-06 02:57:33,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:33,039 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:33,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 02:57:33,041 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 3409 transitions, 163916 flow [2022-12-06 02:57:33,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:57:33,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:33,041 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:57:33,046 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:57:33,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:33,245 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:57:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash 717745261, now seen corresponding path program 2 times [2022-12-06 02:57:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:33,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224297162] [2022-12-06 02:57:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:33,343 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:57:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224297162] [2022-12-06 02:57:33,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224297162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575455272] [2022-12-06 02:57:33,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:57:33,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:33,361 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:57:33,362 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:57:33,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:57:33,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:33,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:57:33,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:33,524 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:57:33,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:33,583 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:57:33,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575455272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:33,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:33,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-06 02:57:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858894748] [2022-12-06 02:57:33,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:33,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:57:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:57:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:57:33,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:57:33,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 3409 transitions, 163916 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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:57:33,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:33,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:57:33,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:39,691 INFO L130 PetriNetUnfolder]: 4039/7024 cut-off events. [2022-12-06 02:57:39,691 INFO L131 PetriNetUnfolder]: For 35561/35561 co-relation queries the response was YES. [2022-12-06 02:57:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170126 conditions, 7024 events. 4039/7024 cut-off events. For 35561/35561 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 49049 event pairs, 14 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 73024. Up to 6501 conditions per place. [2022-12-06 02:57:39,734 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 1067 selfloop transitions, 175 changer transitions 2108/3361 dead transitions. [2022-12-06 02:57:39,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 3361 transitions, 168264 flow [2022-12-06 02:57:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:57:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:57:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-06 02:57:39,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2022-12-06 02:57:39,735 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2022-12-06 02:57:39,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:39,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 3361 transitions, 168264 flow [2022-12-06 02:57:39,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 3361 transitions, 168264 flow [2022-12-06 02:57:39,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:39,848 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:39,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 02:57:39,848 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 3361 transitions, 168264 flow [2022-12-06 02:57:39,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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:57:39,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:39,849 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:57:39,853 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:57:40,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:40,053 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:57:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2010451727, now seen corresponding path program 3 times [2022-12-06 02:57:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:40,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265535580] [2022-12-06 02:57:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:40,129 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:57:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:40,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265535580] [2022-12-06 02:57:40,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265535580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:40,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045696517] [2022-12-06 02:57:40,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:57:40,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:40,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:40,131 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:57:40,133 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:57:40,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:57:40,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:40,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:57:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:40,299 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:57:40,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:40,349 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:57:40,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045696517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:40,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:40,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-12-06 02:57:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185856160] [2022-12-06 02:57:40,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:40,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:57:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:40,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:57:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:57:40,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:57:40,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 3361 transitions, 168264 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 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:57:40,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:40,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:57:40,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:46,156 INFO L130 PetriNetUnfolder]: 4005/6946 cut-off events. [2022-12-06 02:57:46,156 INFO L131 PetriNetUnfolder]: For 37488/37488 co-relation queries the response was YES. [2022-12-06 02:57:46,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175021 conditions, 6946 events. 4005/6946 cut-off events. For 37488/37488 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 48271 event pairs, 14 based on Foata normal form. 0/6380 useless extension candidates. Maximal degree in co-relation 76028. Up to 6425 conditions per place. [2022-12-06 02:57:46,195 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 977 selfloop transitions, 214 changer transitions 2108/3310 dead transitions. [2022-12-06 02:57:46,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 3310 transitions, 172264 flow [2022-12-06 02:57:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:57:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:57:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-06 02:57:46,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 02:57:46,196 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2022-12-06 02:57:46,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:46,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 3310 transitions, 172264 flow [2022-12-06 02:57:46,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 3310 transitions, 172264 flow [2022-12-06 02:57:46,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:46,302 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:46,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 02:57:46,302 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 3310 transitions, 172264 flow [2022-12-06 02:57:46,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 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:57:46,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:46,302 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:57:46,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 02:57:46,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 02:57:46,506 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:57:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1737692447, now seen corresponding path program 4 times [2022-12-06 02:57:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176883765] [2022-12-06 02:57:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:46,578 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:57:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:46,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176883765] [2022-12-06 02:57:46,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176883765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185874925] [2022-12-06 02:57:46,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:57:46,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:46,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:46,580 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:57:46,582 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:57:46,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:57:46,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:46,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:57:46,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:46,727 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:57:46,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:46,784 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:57:46,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185874925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:46,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:46,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 18 [2022-12-06 02:57:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300157097] [2022-12-06 02:57:46,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:46,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:57:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:57:46,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:57:46,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:57:46,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 3310 transitions, 172264 flow. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:57:46,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:46,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:57:46,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:56,082 INFO L130 PetriNetUnfolder]: 5016/8559 cut-off events. [2022-12-06 02:57:56,082 INFO L131 PetriNetUnfolder]: For 39740/39740 co-relation queries the response was YES. [2022-12-06 02:57:56,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224533 conditions, 8559 events. 5016/8559 cut-off events. For 39740/39740 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 59541 event pairs, 14 based on Foata normal form. 0/7533 useless extension candidates. Maximal degree in co-relation 105886. Up to 7942 conditions per place. [2022-12-06 02:57:56,140 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 1461 selfloop transitions, 371 changer transitions 2108/3940 dead transitions. [2022-12-06 02:57:56,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 3940 transitions, 212365 flow [2022-12-06 02:57:56,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 02:57:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 02:57:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 307 transitions. [2022-12-06 02:57:56,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3318918918918919 [2022-12-06 02:57:56,144 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 266 predicate places. [2022-12-06 02:57:56,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:56,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 3940 transitions, 212365 flow [2022-12-06 02:57:56,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 3940 transitions, 212365 flow [2022-12-06 02:57:56,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:56,308 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:56,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 02:57:56,308 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 3940 transitions, 212365 flow [2022-12-06 02:57:56,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:57:56,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:56,308 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:57:56,312 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:57:56,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 02:57:56,512 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:57:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -425164351, now seen corresponding path program 5 times [2022-12-06 02:57:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:56,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505528325] [2022-12-06 02:57:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:56,630 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:57:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505528325] [2022-12-06 02:57:56,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505528325] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498841131] [2022-12-06 02:57:56,630 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:57:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:56,631 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:57:56,633 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:57:56,729 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:57:56,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:56,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:57:56,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:56,791 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:57:56,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:56,842 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:57:56,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498841131] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:56,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:56,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 16 [2022-12-06 02:57:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660256379] [2022-12-06 02:57:56,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:56,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:57:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:57:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:57:56,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:57:56,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 3940 transitions, 212365 flow. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:57:56,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:56,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:57:56,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:05,892 INFO L130 PetriNetUnfolder]: 5045/8614 cut-off events. [2022-12-06 02:58:05,892 INFO L131 PetriNetUnfolder]: For 39487/39487 co-relation queries the response was YES. [2022-12-06 02:58:05,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234613 conditions, 8614 events. 5045/8614 cut-off events. For 39487/39487 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 60092 event pairs, 14 based on Foata normal form. 0/7586 useless extension candidates. Maximal degree in co-relation 111102. Up to 7995 conditions per place. [2022-12-06 02:58:05,963 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 1620 selfloop transitions, 243 changer transitions 2108/3971 dead transitions. [2022-12-06 02:58:05,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 3971 transitions, 221973 flow [2022-12-06 02:58:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:58:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:58:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2022-12-06 02:58:05,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33473684210526317 [2022-12-06 02:58:05,965 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2022-12-06 02:58:05,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:05,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 3971 transitions, 221973 flow [2022-12-06 02:58:06,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 3971 transitions, 221973 flow [2022-12-06 02:58:06,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:06,125 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:06,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 02:58:06,126 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 3971 transitions, 221973 flow [2022-12-06 02:58:06,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:58:06,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:06,126 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:58:06,130 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:58:06,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 02:58:06,331 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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:58:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1117994187, now seen corresponding path program 6 times [2022-12-06 02:58:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:06,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564588776] [2022-12-06 02:58:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:06,402 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:58:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564588776] [2022-12-06 02:58:06,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564588776] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721154713] [2022-12-06 02:58:06,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:58:06,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:06,404 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:58:06,407 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:58:06,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:58:06,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:58:06,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:58:06,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:06,558 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:58:06,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:06,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:58:06,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721154713] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:06,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:06,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 02:58:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598213493] [2022-12-06 02:58:06,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:58:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:58:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:58:06,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:58:06,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 3971 transitions, 221973 flow. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:58:06,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:06,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:58:06,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:14,719 INFO L130 PetriNetUnfolder]: 5399/9166 cut-off events. [2022-12-06 02:58:14,719 INFO L131 PetriNetUnfolder]: For 43240/43240 co-relation queries the response was YES. [2022-12-06 02:58:14,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258855 conditions, 9166 events. 5399/9166 cut-off events. For 43240/43240 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 64084 event pairs, 14 based on Foata normal form. 0/7986 useless extension candidates. Maximal degree in co-relation 129674. Up to 8529 conditions per place. [2022-12-06 02:58:14,785 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 1847 selfloop transitions, 231 changer transitions 2108/4220 dead transitions. [2022-12-06 02:58:14,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 4220 transitions, 244370 flow [2022-12-06 02:58:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:58:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:58:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2022-12-06 02:58:14,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-06 02:58:14,786 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 295 predicate places. [2022-12-06 02:58:14,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:14,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 325 places, 4220 transitions, 244370 flow [2022-12-06 02:58:14,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 4220 transitions, 244370 flow [2022-12-06 02:58:14,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:14,943 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:14,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 02:58:14,947 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 4220 transitions, 244370 flow [2022-12-06 02:58:14,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:58:14,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:14,947 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:58:14,951 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:58:15,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:15,152 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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:58:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1761304217, now seen corresponding path program 7 times [2022-12-06 02:58:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:15,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957002899] [2022-12-06 02:58:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:15,224 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:58:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:15,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957002899] [2022-12-06 02:58:15,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957002899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:15,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734084486] [2022-12-06 02:58:15,224 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:58:15,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:15,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:15,226 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:58:15,227 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:58:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:15,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:58:15,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:15,382 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:58:15,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:15,432 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:58:15,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734084486] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:15,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:15,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 02:58:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411280411] [2022-12-06 02:58:15,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:15,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:58:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:58:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:58:15,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:58:15,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 4220 transitions, 244370 flow. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:58:15,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:15,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:58:15,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:27,194 INFO L130 PetriNetUnfolder]: 5367/9090 cut-off events. [2022-12-06 02:58:27,194 INFO L131 PetriNetUnfolder]: For 45727/45727 co-relation queries the response was YES. [2022-12-06 02:58:27,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265578 conditions, 9090 events. 5367/9090 cut-off events. For 45727/45727 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 63250 event pairs, 14 based on Foata normal form. 0/7940 useless extension candidates. Maximal degree in co-relation 132528. Up to 8455 conditions per place. [2022-12-06 02:58:27,268 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 1647 selfloop transitions, 383 changer transitions 2108/4171 dead transitions. [2022-12-06 02:58:27,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 4171 transitions, 249784 flow [2022-12-06 02:58:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:58:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:58:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 185 transitions. [2022-12-06 02:58:27,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-06 02:58:27,281 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 310 predicate places. [2022-12-06 02:58:27,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:27,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 4171 transitions, 249784 flow [2022-12-06 02:58:27,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 4171 transitions, 249784 flow [2022-12-06 02:58:27,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:27,453 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:27,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 02:58:27,453 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 4171 transitions, 249784 flow [2022-12-06 02:58:27,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:58:27,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:27,454 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:58:27,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 02:58:27,658 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,SelfDestructingSolverStorable28 [2022-12-06 02:58:27,658 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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:58:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1681155585, now seen corresponding path program 8 times [2022-12-06 02:58:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:27,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223137444] [2022-12-06 02:58:27,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:27,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:27,724 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:58:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:27,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223137444] [2022-12-06 02:58:27,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223137444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:27,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444498406] [2022-12-06 02:58:27,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:58:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:27,740 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:58:27,756 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:58:27,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:58:27,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:58:27,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:58:27,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:27,905 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:58:27,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:27,948 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:58:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444498406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:27,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:27,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-06 02:58:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021558394] [2022-12-06 02:58:27,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:27,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:58:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:58:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:58:27,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:58:27,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 4171 transitions, 249784 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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:58:27,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:27,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:58:27,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:40,099 INFO L130 PetriNetUnfolder]: 5333/9012 cut-off events. [2022-12-06 02:58:40,099 INFO L131 PetriNetUnfolder]: For 49471/49471 co-relation queries the response was YES. [2022-12-06 02:58:40,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272091 conditions, 9012 events. 5333/9012 cut-off events. For 49471/49471 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 62474 event pairs, 14 based on Foata normal form. 0/7894 useless extension candidates. Maximal degree in co-relation 135030. Up to 8379 conditions per place. [2022-12-06 02:58:40,173 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 1700 selfloop transitions, 279 changer transitions 2108/4119 dead transitions. [2022-12-06 02:58:40,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 4119 transitions, 254820 flow [2022-12-06 02:58:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:58:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:58:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 02:58:40,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 02:58:40,174 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 315 predicate places. [2022-12-06 02:58:40,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:40,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 4119 transitions, 254820 flow [2022-12-06 02:58:40,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 4119 transitions, 254820 flow [2022-12-06 02:58:40,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:40,352 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:40,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 02:58:40,353 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 4119 transitions, 254820 flow [2022-12-06 02:58:40,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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:58:40,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:40,353 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] [2022-12-06 02:58:40,358 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:58:40,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:40,558 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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:58:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1242622989, now seen corresponding path program 1 times [2022-12-06 02:58:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:40,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682455548] [2022-12-06 02:58:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:41,131 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:58:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:41,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682455548] [2022-12-06 02:58:41,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682455548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:41,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621811188] [2022-12-06 02:58:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:41,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:41,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:41,133 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:58:41,135 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:58:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:41,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 02:58:41,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:41,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:58:41,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:58:41,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 81 [2022-12-06 02:58:41,959 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:58:41,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:43,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:58:43,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 387 treesize of output 819 [2022-12-06 02:59:00,987 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 02:59:09,798 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 02:59:11,980 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 02:59:15,960 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 02:59:27,172 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 02:59:35,973 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 02:59:59,630 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-06 03:00:34,429 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:00:39,098 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:00:55,873 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:00:57,100 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:01:10,287 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:01:23,759 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:01:55,179 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:01:56,953 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:02:10,319 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:02:24,195 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:02:28,838 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:02:35,494 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:03:10,558 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-06 03:03:51,728 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:04:01,399 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:04:14,153 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:04:17,415 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:04:32,411 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:04:47,202 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:04:58,512 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:05:18,552 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:05:38,503 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:05:50,612 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:06:02,635 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:06:16,300 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:06:23,715 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:06:36,127 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:07:18,991 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:07:21,988 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:07:22,866 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 03:08:03,007 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. Received shutdown request... [2022-12-06 03:09:39,341 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 03:09:39,341 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:09:39,347 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 03:09:39,350 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 03:09:39,354 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 03:09:39,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:39,551 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 41ms.. [2022-12-06 03:09:39,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 03:09:39,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 03:09:39,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 03:09:39,552 INFO L458 BasicCegarLoop]: Path program histogram: [11, 8, 6, 2, 1, 1, 1, 1] [2022-12-06 03:09:39,554 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:09:39,555 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:09:39,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:09:39 BasicIcfg [2022-12-06 03:09:39,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:09:39,556 INFO L158 Benchmark]: Toolchain (without parser) took 854247.01ms. Allocated memory was 177.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 153.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 03:09:39,556 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:09:39,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.18ms. Allocated memory is still 177.2MB. Free memory was 153.4MB in the beginning and 141.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 03:09:39,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.25ms. Allocated memory is still 177.2MB. Free memory was 141.3MB in the beginning and 139.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:09:39,557 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 177.2MB. Free memory was 139.8MB in the beginning and 138.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:09:39,557 INFO L158 Benchmark]: RCFGBuilder took 379.54ms. Allocated memory is still 177.2MB. Free memory was 137.7MB in the beginning and 117.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 03:09:39,557 INFO L158 Benchmark]: TraceAbstraction took 853552.75ms. Allocated memory was 177.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 117.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 03:09:39,558 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.18ms. Allocated memory is still 177.2MB. Free memory was 153.4MB in the beginning and 141.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.25ms. Allocated memory is still 177.2MB. Free memory was 141.3MB in the beginning and 139.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 177.2MB. Free memory was 139.8MB in the beginning and 138.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 379.54ms. Allocated memory is still 177.2MB. Free memory was 137.7MB in the beginning and 117.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 853552.75ms. Allocated memory was 177.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 117.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 126 PlacesBefore, 30 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 706, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 712, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 712, unknown conditional: 0, unknown unconditional: 712] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1126, Positive conditional cache size: 0, Positive unconditional cache size: 1126, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 32 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 16 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, 50 PlacesBefore, 50 PlacesAfterwards, 355 TransitionsBefore, 355 TransitionsAfterwards, 24 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, 59 PlacesBefore, 59 PlacesAfterwards, 451 TransitionsBefore, 451 TransitionsAfterwards, 24 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, 68 PlacesBefore, 68 PlacesAfterwards, 425 TransitionsBefore, 425 TransitionsAfterwards, 24 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, 77 PlacesBefore, 77 PlacesAfterwards, 421 TransitionsBefore, 421 TransitionsAfterwards, 24 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, 86 PlacesBefore, 86 PlacesAfterwards, 395 TransitionsBefore, 395 TransitionsAfterwards, 24 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: 1.9s, 90 PlacesBefore, 89 PlacesAfterwards, 361 TransitionsBefore, 360 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 1269 TransitionsBefore, 1269 TransitionsAfterwards, 20 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, 120 PlacesBefore, 120 PlacesAfterwards, 1689 TransitionsBefore, 1689 TransitionsAfterwards, 20 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, 128 PlacesBefore, 128 PlacesAfterwards, 2007 TransitionsBefore, 2007 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 160 PlacesBefore, 160 PlacesAfterwards, 3809 TransitionsBefore, 3809 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, 191 PlacesBefore, 191 PlacesAfterwards, 4148 TransitionsBefore, 4148 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, 202 PlacesBefore, 202 PlacesAfterwards, 4221 TransitionsBefore, 4221 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, 225 PlacesBefore, 225 PlacesAfterwards, 4492 TransitionsBefore, 4492 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, 4649 TransitionsBefore, 4649 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, 5328 TransitionsBefore, 5328 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, 256 PlacesBefore, 256 PlacesAfterwards, 5501 TransitionsBefore, 5501 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, 259 PlacesBefore, 259 PlacesAfterwards, 4059 TransitionsBefore, 4059 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, 245 PlacesBefore, 245 PlacesAfterwards, 3553 TransitionsBefore, 3553 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, 237 PlacesBefore, 237 PlacesAfterwards, 3114 TransitionsBefore, 3114 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, 248 PlacesBefore, 248 PlacesAfterwards, 3409 TransitionsBefore, 3409 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, 254 PlacesBefore, 254 PlacesAfterwards, 3361 TransitionsBefore, 3361 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, 260 PlacesBefore, 260 PlacesAfterwards, 3310 TransitionsBefore, 3310 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, 296 PlacesBefore, 296 PlacesAfterwards, 3940 TransitionsBefore, 3940 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, 314 PlacesBefore, 314 PlacesAfterwards, 3971 TransitionsBefore, 3971 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, 325 PlacesBefore, 325 PlacesAfterwards, 4220 TransitionsBefore, 4220 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, 340 PlacesBefore, 340 PlacesAfterwards, 4171 TransitionsBefore, 4171 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, 345 PlacesBefore, 345 PlacesAfterwards, 4119 TransitionsBefore, 4119 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: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 41ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 41ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 41ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 41ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 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: 853.4s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 162.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 3613 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3613 mSDsluCounter, 929 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 606 IncrementalHoareTripleChecker+Unchecked, 755 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15703 IncrementalHoareTripleChecker+Invalid, 16534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 174 mSDtfsCounter, 15703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1366 GetRequests, 719 SyntacticMatches, 36 SemanticMatches, 611 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254820occurred in iteration=30, InterpolantAutomatonStates: 401, 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, 0.9s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1458 ConstructedInterpolants, 38 QuantifiedInterpolants, 19311 SizeOfPredicates, 255 NumberOfNonLiveVariables, 4220 ConjunctsInSsa, 434 ConjunctsInUnsatCore, 70 InterpolantComputations, 11 PerfectInterpolantSequences, 91/189 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