/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:08:54,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:08:54,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:08:54,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:08:54,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:08:54,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:08:54,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:08:54,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:08:54,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:08:54,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:08:54,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:08:54,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:08:54,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:08:54,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:08:54,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:08:54,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:08:54,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:08:54,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:08:54,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:08:54,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:08:54,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:08:54,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:08:54,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:08:54,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:08:54,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:08:54,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:08:54,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:08:54,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:08:54,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:08:54,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:08:54,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:08:54,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:08:54,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:08:54,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:08:54,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:08:54,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:08:54,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:08:54,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:08:54,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:08:54,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:08:54,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:08:54,708 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 00:08:54,732 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:08:54,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:08:54,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:08:54,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:08:54,734 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:08:54,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:08:54,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:08:54,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:08:54,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:08:54,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:08:54,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:08:54,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:08:54,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:08:54,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:08:54,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:08:54,738 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:08:54,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:08:55,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:08:55,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:08:55,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:08:55,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:08:55,071 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:08:55,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 00:08:56,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:08:56,202 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:08:56,203 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 00:08:56,209 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e922dba/470925832c754e489a18f3f068f34040/FLAGa9e794148 [2022-12-06 00:08:56,224 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e922dba/470925832c754e489a18f3f068f34040 [2022-12-06 00:08:56,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:08:56,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:08:56,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:08:56,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:08:56,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:08:56,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e213a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56, skipping insertion in model container [2022-12-06 00:08:56,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:08:56,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:08:56,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,447 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 00:08:56,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:08:56,464 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:08:56,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:56,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:56,503 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 00:08:56,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:08:56,514 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:08:56,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56 WrapperNode [2022-12-06 00:08:56,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:08:56,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:08:56,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:08:56,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:08:56,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,558 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-12-06 00:08:56,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:08:56,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:08:56,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:08:56,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:08:56,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:08:56,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:08:56,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:08:56,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:08:56,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (1/1) ... [2022-12-06 00:08:56,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:08:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:56,636 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 00:08:56,648 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 00:08:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:08:56,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:08:56,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:08:56,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:08:56,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:08:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:08:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:08:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:08:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:08:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:08:56,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:08:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:08:56,666 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 00:08:56,786 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:08:56,787 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:08:57,227 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:08:57,370 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:08:57,370 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 00:08:57,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:08:57 BoogieIcfgContainer [2022-12-06 00:08:57,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:08:57,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:08:57,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:08:57,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:08:57,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:08:56" (1/3) ... [2022-12-06 00:08:57,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3f1bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:08:57, skipping insertion in model container [2022-12-06 00:08:57,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:56" (2/3) ... [2022-12-06 00:08:57,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3f1bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:08:57, skipping insertion in model container [2022-12-06 00:08:57,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:08:57" (3/3) ... [2022-12-06 00:08:57,378 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-12-06 00:08:57,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:08:57,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:08:57,391 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:08:57,452 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 00:08:57,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 00:08:57,582 INFO L130 PetriNetUnfolder]: 37/327 cut-off events. [2022-12-06 00:08:57,582 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:08:57,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 327 events. 37/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 00:08:57,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 00:08:57,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 315 transitions, 654 flow [2022-12-06 00:08:57,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:57,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 00:08:57,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 315 transitions, 654 flow [2022-12-06 00:08:57,685 INFO L130 PetriNetUnfolder]: 37/315 cut-off events. [2022-12-06 00:08:57,685 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:08:57,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 315 events. 37/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 00:08:57,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 00:08:57,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 5184 [2022-12-06 00:09:09,005 INFO L203 LiptonReduction]: Total number of compositions: 274 [2022-12-06 00:09:09,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:09:09,020 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;@3e66f329, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:09:09,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 00:09:09,026 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 00:09:09,026 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:09:09,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:09,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:09,027 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 2 more)] === [2022-12-06 00:09:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1058262679, now seen corresponding path program 1 times [2022-12-06 00:09:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:09,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605203810] [2022-12-06 00:09:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:09,580 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 00:09:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:09,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605203810] [2022-12-06 00:09:09,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605203810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:09,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:09,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:09:09,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023253217] [2022-12-06 00:09:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:09,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:09:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:09:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:09:09,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:09:09,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:09,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:09:09,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:09,769 INFO L130 PetriNetUnfolder]: 501/685 cut-off events. [2022-12-06 00:09:09,770 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 00:09:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 685 events. 501/685 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1774 event pairs, 117 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-06 00:09:09,774 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 49 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-12-06 00:09:09,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 265 flow [2022-12-06 00:09:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 00:09:09,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2022-12-06 00:09:09,784 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 56 transitions. [2022-12-06 00:09:09,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 265 flow [2022-12-06 00:09:09,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 00:09:09,788 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 107 flow [2022-12-06 00:09:09,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-06 00:09:09,792 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-06 00:09:09,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:09,792 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 107 flow [2022-12-06 00:09:09,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:09,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:09,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-06 00:09:09,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 107 flow [2022-12-06 00:09:09,802 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1652] L154-1-->L154-1: Formula: (let ((.cse2 (= v_~client_state~0_In_4 1)) (.cse3 (= v_~manager_back~0_In_12 v_~manager_back~0_Out_28)) (.cse5 (= |v_thread4Thread1of1ForFork2_#t~post26#1_Out_8| |v_thread4Thread1of1ForFork2_#t~post26#1_In_3|)) (.cse8 (= |v_thread4Thread1of1ForFork2_#t~mem25#1_In_3| |v_thread4Thread1of1ForFork2_#t~mem25#1_Out_8|)) (.cse9 (= v_~client_state~0_In_4 0)) (.cse0 (= v_~safe~0_Out_36 v_~safe~0_In_10)) (.cse1 (= |v_thread4Thread1of1ForFork2_#t~mem27#1_In_3| |v_thread4Thread1of1ForFork2_#t~mem27#1_Out_8|)) (.cse4 (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1| 256) 0))) (.cse6 (= |v_thread4Thread1of1ForFork2_#t~post28#1_In_3| |v_thread4Thread1of1ForFork2_#t~post28#1_Out_8|)) (.cse10 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse7 (= v_~client_front~0_In_6 v_~client_front~0_Out_20)) (.cse11 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|))) (or (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_~client_state~0_Out_14 v_~client_state~0_In_4) (not .cse9) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|)) (and (= (ite (= (ite (= v_~ok~0_In_10 (select (select |v_#memory_int_In_42| v_~client~0.base_In_5) (+ (* v_~client_front~0_In_6 4) v_~client~0.offset_In_5))) 1 0) 0) 0 1) v_~safe~0_Out_36) .cse2 (= (+ v_~client_front~0_In_6 1) v_~client_front~0_Out_20) .cse3 .cse4 .cse5 .cse10 .cse8 .cse11 (= v_~client_state~0_Out_14 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (< v_~client_back~0_In_5 v_~client_size~0_In_6) (<= 0 v_~client_front~0_In_6) (< v_~client_front~0_In_6 v_~client_back~0_In_5)) 1 0))) (and (not (= (ite (and (<= 0 v_~manager_back~0_In_12) (< v_~manager_back~0_In_12 v_~manager_size~0_In_14)) 1 0) 0)) .cse9 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| (ite (= v_~update~0_In_14 (select (select |v_#memory_int_In_42| v_~manager~0.base_In_12) (+ (* v_~manager_back~0_In_12 4) v_~manager~0.offset_In_12))) 1 0)) .cse0 .cse1 (= v_~client_state~0_Out_14 1) .cse4 .cse6 (= v_~manager_back~0_Out_28 (+ v_~manager_back~0_In_12 1)) .cse10 .cse7 .cse11))) InVars {~client~0.offset=v_~client~0.offset_In_5, ~client_back~0=v_~client_back~0_In_5, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3|, ~manager~0.offset=v_~manager~0.offset_In_12, ~ok~0=v_~ok~0_In_10, ~manager~0.base=v_~manager~0.base_In_12, thread4Thread1of1ForFork2_#t~nondet24#1=|v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1|, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_In_3|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|, ~manager_back~0=v_~manager_back~0_In_12, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_In_3|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_In_3|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_In_3|, ~client_front~0=v_~client_front~0_In_6, ~safe~0=v_~safe~0_In_10, #memory_int=|v_#memory_int_In_42|, ~client_state~0=v_~client_state~0_In_4, ~client_size~0=v_~client_size~0_In_6, ~manager_size~0=v_~manager_size~0_In_14, ~client~0.base=v_~client~0.base_In_5, ~update~0=v_~update~0_In_14} OutVars{~client~0.offset=v_~client~0.offset_In_5, ~client_back~0=v_~client_back~0_In_5, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|, ~manager~0.offset=v_~manager~0.offset_In_12, ~ok~0=v_~ok~0_In_10, ~manager~0.base=v_~manager~0.base_In_12, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_Out_8|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, ~manager_back~0=v_~manager_back~0_Out_28, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_Out_8|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_Out_8|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_Out_8|, ~client_front~0=v_~client_front~0_Out_20, ~safe~0=v_~safe~0_Out_36, #memory_int=|v_#memory_int_In_42|, ~client_state~0=v_~client_state~0_Out_14, ~client_size~0=v_~client_size~0_In_6, ~manager_size~0=v_~manager_size~0_In_14, ~client~0.base=v_~client~0.base_In_5, ~update~0=v_~update~0_In_14} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~client_front~0, ~safe~0, thread4Thread1of1ForFork2_#t~nondet24#1, thread4Thread1of1ForFork2_#t~post26#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, ~client_state~0, thread4Thread1of1ForFork2_#t~mem27#1, thread4Thread1of1ForFork2_#t~post28#1, thread4Thread1of1ForFork2_#t~mem25#1][26], [310#true, 141#L110-1true, 80#L154-1true, 175#L132-1true, 86#L199-4true, Black: 312#(= ~safe~0 1), 89#L88-1true]) [2022-12-06 00:09:09,802 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 00:09:09,803 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 00:09:09,803 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 00:09:09,803 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 00:09:09,806 INFO L130 PetriNetUnfolder]: 23/63 cut-off events. [2022-12-06 00:09:09,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:09:09,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 63 events. 23/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-06 00:09:09,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-06 00:09:09,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 00:09:09,808 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:09,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:09:09,809 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 107 flow [2022-12-06 00:09:09,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:09,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:09,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:09:09,824 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 2 more)] === [2022-12-06 00:09:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1410111894, now seen corresponding path program 1 times [2022-12-06 00:09:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:09,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233328532] [2022-12-06 00:09:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:10,524 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 00:09:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:10,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233328532] [2022-12-06 00:09:10,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233328532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:10,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858680107] [2022-12-06 00:09:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:10,528 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 00:09:10,551 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 00:09:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:10,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:09:10,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:10,794 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 00:09:10,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:09:10,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858680107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:10,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:09:10,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2022-12-06 00:09:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911184583] [2022-12-06 00:09:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:09:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:09:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:09:10,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:09:10,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 00:09:10,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:10,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:09:10,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:10,941 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-06 00:09:10,941 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 00:09:10,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 647 events. 467/647 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1704 event pairs, 117 based on Foata normal form. 30/673 useless extension candidates. Maximal degree in co-relation 471. Up to 433 conditions per place. [2022-12-06 00:09:10,944 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2022-12-06 00:09:10,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 244 flow [2022-12-06 00:09:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 00:09:10,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-06 00:09:10,945 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 107 flow. Second operand 3 states and 53 transitions. [2022-12-06 00:09:10,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 244 flow [2022-12-06 00:09:10,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:09:10,947 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 106 flow [2022-12-06 00:09:10,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-06 00:09:10,947 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-06 00:09:10,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:10,947 INFO L89 Accepts]: Start accepts. Operand has 34 places, 36 transitions, 106 flow [2022-12-06 00:09:10,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:10,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:10,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 106 flow [2022-12-06 00:09:10,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 106 flow [2022-12-06 00:09:10,956 INFO L130 PetriNetUnfolder]: 18/54 cut-off events. [2022-12-06 00:09:10,956 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 54 events. 18/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 43. Up to 17 conditions per place. [2022-12-06 00:09:10,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 106 flow [2022-12-06 00:09:10,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 00:09:10,957 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:10,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:09:10,958 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 106 flow [2022-12-06 00:09:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 00:09:10,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:10,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:10,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:09:11,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:11,172 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 2 more)] === [2022-12-06 00:09:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 573276739, now seen corresponding path program 1 times [2022-12-06 00:09:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:11,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555816100] [2022-12-06 00:09:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:11,389 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 00:09:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:11,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555816100] [2022-12-06 00:09:11,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555816100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:11,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:11,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774950249] [2022-12-06 00:09:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:11,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:11,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:09:11,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 00:09:11,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:11,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:09:11,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:11,757 INFO L130 PetriNetUnfolder]: 1278/1817 cut-off events. [2022-12-06 00:09:11,757 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2022-12-06 00:09:11,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 1817 events. 1278/1817 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6192 event pairs, 801 based on Foata normal form. 120/1926 useless extension candidates. Maximal degree in co-relation 1325. Up to 648 conditions per place. [2022-12-06 00:09:11,763 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 92 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2022-12-06 00:09:11,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 100 transitions, 482 flow [2022-12-06 00:09:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:09:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:09:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 00:09:11,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 00:09:11,765 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 106 flow. Second operand 5 states and 95 transitions. [2022-12-06 00:09:11,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 100 transitions, 482 flow [2022-12-06 00:09:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 100 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:11,767 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 164 flow [2022-12-06 00:09:11,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2022-12-06 00:09:11,767 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-06 00:09:11,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:11,768 INFO L89 Accepts]: Start accepts. Operand has 39 places, 43 transitions, 164 flow [2022-12-06 00:09:11,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:11,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:11,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 43 transitions, 164 flow [2022-12-06 00:09:11,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 43 transitions, 164 flow [2022-12-06 00:09:11,783 INFO L130 PetriNetUnfolder]: 37/140 cut-off events. [2022-12-06 00:09:11,783 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 00:09:11,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 140 events. 37/140 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 430 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 125. Up to 35 conditions per place. [2022-12-06 00:09:11,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 43 transitions, 164 flow [2022-12-06 00:09:11,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 00:09:16,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:16,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5158 [2022-12-06 00:09:16,927 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 170 flow [2022-12-06 00:09:16,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 00:09:16,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:16,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:09:16,927 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 2 more)] === [2022-12-06 00:09:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash -93352592, now seen corresponding path program 1 times [2022-12-06 00:09:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:16,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422450121] [2022-12-06 00:09:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:17,132 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 00:09:17,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:17,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422450121] [2022-12-06 00:09:17,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422450121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:17,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:17,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564630042] [2022-12-06 00:09:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:17,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:17,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:17,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:09:17,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:17,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:09:17,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:17,625 INFO L130 PetriNetUnfolder]: 2274/3257 cut-off events. [2022-12-06 00:09:17,625 INFO L131 PetriNetUnfolder]: For 1290/1290 co-relation queries the response was YES. [2022-12-06 00:09:17,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 3257 events. 2274/3257 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13307 event pairs, 777 based on Foata normal form. 204/3459 useless extension candidates. Maximal degree in co-relation 4835. Up to 1469 conditions per place. [2022-12-06 00:09:17,638 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 74 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2022-12-06 00:09:17,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 79 transitions, 434 flow [2022-12-06 00:09:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 00:09:17,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 00:09:17,641 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 170 flow. Second operand 4 states and 73 transitions. [2022-12-06 00:09:17,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 79 transitions, 434 flow [2022-12-06 00:09:17,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 79 transitions, 426 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 00:09:17,649 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 179 flow [2022-12-06 00:09:17,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2022-12-06 00:09:17,650 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 00:09:17,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:17,650 INFO L89 Accepts]: Start accepts. Operand has 43 places, 43 transitions, 179 flow [2022-12-06 00:09:17,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:17,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:17,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 43 transitions, 179 flow [2022-12-06 00:09:17,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 179 flow [2022-12-06 00:09:17,683 INFO L130 PetriNetUnfolder]: 41/189 cut-off events. [2022-12-06 00:09:17,683 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 00:09:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 189 events. 41/189 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 775 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 52 conditions per place. [2022-12-06 00:09:17,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 179 flow [2022-12-06 00:09:17,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 00:09:17,685 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:17,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 00:09:17,685 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 179 flow [2022-12-06 00:09:17,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:17,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:17,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:09:17,686 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 2 more)] === [2022-12-06 00:09:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1074394720, now seen corresponding path program 1 times [2022-12-06 00:09:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:17,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340373923] [2022-12-06 00:09:17,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:17,878 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 00:09:17,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:17,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340373923] [2022-12-06 00:09:17,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340373923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:17,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:17,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:17,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479165094] [2022-12-06 00:09:17,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:17,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:17,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:17,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:17,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:17,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:09:17,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:17,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:09:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:18,107 INFO L130 PetriNetUnfolder]: 1078/1592 cut-off events. [2022-12-06 00:09:18,107 INFO L131 PetriNetUnfolder]: For 1164/1164 co-relation queries the response was YES. [2022-12-06 00:09:18,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1592 events. 1078/1592 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5769 event pairs, 761 based on Foata normal form. 72/1663 useless extension candidates. Maximal degree in co-relation 3239. Up to 1168 conditions per place. [2022-12-06 00:09:18,113 INFO L137 encePairwiseOnDemand]: 32/34 looper letters, 37 selfloop transitions, 0 changer transitions 31/68 dead transitions. [2022-12-06 00:09:18,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 383 flow [2022-12-06 00:09:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 00:09:18,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 00:09:18,114 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 179 flow. Second operand 3 states and 60 transitions. [2022-12-06 00:09:18,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 383 flow [2022-12-06 00:09:18,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 372 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:18,118 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 132 flow [2022-12-06 00:09:18,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 00:09:18,120 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 00:09:18,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:18,120 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 132 flow [2022-12-06 00:09:18,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:18,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:18,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 132 flow [2022-12-06 00:09:18,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 132 flow [2022-12-06 00:09:18,132 INFO L130 PetriNetUnfolder]: 24/78 cut-off events. [2022-12-06 00:09:18,133 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 00:09:18,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 78 events. 24/78 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 89. Up to 28 conditions per place. [2022-12-06 00:09:18,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 37 transitions, 132 flow [2022-12-06 00:09:18,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 00:09:18,134 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:18,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:09:18,136 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 132 flow [2022-12-06 00:09:18,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:18,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:18,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:18,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:09:18,136 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 2 more)] === [2022-12-06 00:09:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2021498286, now seen corresponding path program 1 times [2022-12-06 00:09:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:18,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231635862] [2022-12-06 00:09:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:18,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:18,310 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 00:09:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:18,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231635862] [2022-12-06 00:09:18,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231635862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:18,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:18,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078788134] [2022-12-06 00:09:18,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:18,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:18,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:09:18,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 00:09:18,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:18,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:09:18,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:18,571 INFO L130 PetriNetUnfolder]: 999/1403 cut-off events. [2022-12-06 00:09:18,572 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2022-12-06 00:09:18,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1403 events. 999/1403 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4506 event pairs, 261 based on Foata normal form. 64/1466 useless extension candidates. Maximal degree in co-relation 3601. Up to 541 conditions per place. [2022-12-06 00:09:18,578 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 65 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-06 00:09:18,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 358 flow [2022-12-06 00:09:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 00:09:18,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:09:18,579 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 132 flow. Second operand 4 states and 66 transitions. [2022-12-06 00:09:18,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 358 flow [2022-12-06 00:09:18,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 344 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:18,581 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 130 flow [2022-12-06 00:09:18,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 00:09:18,583 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 00:09:18,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:18,584 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 130 flow [2022-12-06 00:09:18,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:18,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:18,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 130 flow [2022-12-06 00:09:18,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 130 flow [2022-12-06 00:09:18,597 INFO L130 PetriNetUnfolder]: 18/76 cut-off events. [2022-12-06 00:09:18,597 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 00:09:18,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 76 events. 18/76 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 1 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 76. Up to 25 conditions per place. [2022-12-06 00:09:18,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 130 flow [2022-12-06 00:09:18,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 00:09:18,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:18,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 00:09:18,599 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 130 flow [2022-12-06 00:09:18,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 00:09:18,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:18,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:18,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:09:18,599 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 2 more)] === [2022-12-06 00:09:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash -336909090, now seen corresponding path program 1 times [2022-12-06 00:09:18,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:18,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340269045] [2022-12-06 00:09:18,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:18,772 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 00:09:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:18,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340269045] [2022-12-06 00:09:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340269045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:18,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884794388] [2022-12-06 00:09:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:18,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:18,774 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 00:09:18,776 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 00:09:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:18,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:09:18,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:18,944 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 00:09:18,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:09:19,055 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 00:09:19,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884794388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:09:19,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:09:19,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 00:09:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842025184] [2022-12-06 00:09:19,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:09:19,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:09:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:09:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:09:19,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:09:19,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 130 flow. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:19,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:19,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:09:19,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:19,277 INFO L130 PetriNetUnfolder]: 1127/1592 cut-off events. [2022-12-06 00:09:19,277 INFO L131 PetriNetUnfolder]: For 1202/1202 co-relation queries the response was YES. [2022-12-06 00:09:19,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 1592 events. 1127/1592 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5455 event pairs, 277 based on Foata normal form. 1/1589 useless extension candidates. Maximal degree in co-relation 1293. Up to 1205 conditions per place. [2022-12-06 00:09:19,284 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 56 selfloop transitions, 4 changer transitions 3/63 dead transitions. [2022-12-06 00:09:19,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 328 flow [2022-12-06 00:09:19,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 00:09:19,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-06 00:09:19,285 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 130 flow. Second operand 4 states and 61 transitions. [2022-12-06 00:09:19,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 328 flow [2022-12-06 00:09:19,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:19,287 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 158 flow [2022-12-06 00:09:19,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-06 00:09:19,288 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 00:09:19,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:19,288 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 158 flow [2022-12-06 00:09:19,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:19,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:19,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 158 flow [2022-12-06 00:09:19,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 158 flow [2022-12-06 00:09:19,301 INFO L130 PetriNetUnfolder]: 19/80 cut-off events. [2022-12-06 00:09:19,301 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 00:09:19,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 80 events. 19/80 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 1 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 90. Up to 27 conditions per place. [2022-12-06 00:09:19,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 158 flow [2022-12-06 00:09:19,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 00:09:19,304 WARN L322 ript$VariableManager]: TermVariable LBE356 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:19,304 WARN L322 ript$VariableManager]: TermVariable LBE774 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:19,304 WARN L322 ript$VariableManager]: TermVariable LBE344 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:19,304 WARN L322 ript$VariableManager]: TermVariable LBE376 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:19,304 WARN L322 ript$VariableManager]: TermVariable LBE839 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:19,305 WARN L322 ript$VariableManager]: TermVariable LBE799 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:20,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:20,021 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-06 00:09:20,021 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 159 flow [2022-12-06 00:09:20,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:20,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:20,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:20,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:09:20,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 00:09:20,228 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 2 more)] === [2022-12-06 00:09:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 729180131, now seen corresponding path program 1 times [2022-12-06 00:09:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:20,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535428754] [2022-12-06 00:09:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:20,595 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 00:09:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:20,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535428754] [2022-12-06 00:09:20,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535428754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:20,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:20,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392218018] [2022-12-06 00:09:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:20,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:20,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:09:20,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 00:09:20,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:20,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:09:20,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:20,856 INFO L130 PetriNetUnfolder]: 969/1372 cut-off events. [2022-12-06 00:09:20,857 INFO L131 PetriNetUnfolder]: For 1294/1294 co-relation queries the response was YES. [2022-12-06 00:09:20,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1372 events. 969/1372 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4508 event pairs, 397 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 854. Up to 1158 conditions per place. [2022-12-06 00:09:20,863 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 38 selfloop transitions, 2 changer transitions 9/49 dead transitions. [2022-12-06 00:09:20,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 264 flow [2022-12-06 00:09:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 00:09:20,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 00:09:20,864 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 159 flow. Second operand 3 states and 47 transitions. [2022-12-06 00:09:20,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 264 flow [2022-12-06 00:09:20,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 256 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:20,867 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 134 flow [2022-12-06 00:09:20,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 00:09:20,869 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 00:09:20,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:20,869 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 134 flow [2022-12-06 00:09:20,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:20,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:20,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 134 flow [2022-12-06 00:09:20,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 134 flow [2022-12-06 00:09:20,884 INFO L130 PetriNetUnfolder]: 17/74 cut-off events. [2022-12-06 00:09:20,884 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 00:09:20,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 74 events. 17/74 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 1 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 104. Up to 22 conditions per place. [2022-12-06 00:09:20,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 134 flow [2022-12-06 00:09:20,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 00:09:20,885 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:20,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:09:20,887 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 134 flow [2022-12-06 00:09:20,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 00:09:20,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:20,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:20,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:09:20,888 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 2 more)] === [2022-12-06 00:09:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2018565861, now seen corresponding path program 1 times [2022-12-06 00:09:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:20,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385593131] [2022-12-06 00:09:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:22,129 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 00:09:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385593131] [2022-12-06 00:09:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385593131] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705794831] [2022-12-06 00:09:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:22,145 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 00:09:22,146 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 00:09:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:22,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 00:09:22,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:22,339 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 11 treesize of output 7 [2022-12-06 00:09:22,426 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 00:09:22,462 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 00:09:22,508 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 00:09:22,550 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 00:09:22,669 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 00:09:22,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:09:25,690 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 00:09:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705794831] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:09:25,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:09:25,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2022-12-06 00:09:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331766378] [2022-12-06 00:09:25,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:09:25,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:09:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:09:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=406, Unknown=15, NotChecked=0, Total=552 [2022-12-06 00:09:25,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:09:25,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 134 flow. Second operand has 24 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 00:09:25,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:25,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:09:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:31,250 INFO L130 PetriNetUnfolder]: 2403/3550 cut-off events. [2022-12-06 00:09:31,250 INFO L131 PetriNetUnfolder]: For 2437/2437 co-relation queries the response was YES. [2022-12-06 00:09:31,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9444 conditions, 3550 events. 2403/3550 cut-off events. For 2437/2437 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16012 event pairs, 522 based on Foata normal form. 3/3536 useless extension candidates. Maximal degree in co-relation 4121. Up to 1436 conditions per place. [2022-12-06 00:09:31,263 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 131 selfloop transitions, 42 changer transitions 71/244 dead transitions. [2022-12-06 00:09:31,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 244 transitions, 1190 flow [2022-12-06 00:09:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 00:09:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 00:09:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2022-12-06 00:09:31,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3347107438016529 [2022-12-06 00:09:31,265 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 134 flow. Second operand 22 states and 243 transitions. [2022-12-06 00:09:31,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 244 transitions, 1190 flow [2022-12-06 00:09:31,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 244 transitions, 1178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:31,273 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 500 flow [2022-12-06 00:09:31,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=500, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2022-12-06 00:09:31,274 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-06 00:09:31,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:31,274 INFO L89 Accepts]: Start accepts. Operand has 74 places, 77 transitions, 500 flow [2022-12-06 00:09:31,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:31,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:31,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 500 flow [2022-12-06 00:09:31,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 500 flow [2022-12-06 00:09:31,316 INFO L130 PetriNetUnfolder]: 108/452 cut-off events. [2022-12-06 00:09:31,316 INFO L131 PetriNetUnfolder]: For 324/326 co-relation queries the response was YES. [2022-12-06 00:09:31,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 452 events. 108/452 cut-off events. For 324/326 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2722 event pairs, 47 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1061. Up to 100 conditions per place. [2022-12-06 00:09:31,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 500 flow [2022-12-06 00:09:31,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 00:09:46,665 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,665 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,666 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:46,667 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:10:02,838 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:10:02,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31565 [2022-12-06 00:10:02,839 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 521 flow [2022-12-06 00:10:02,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 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 00:10:02,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:02,840 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:02,851 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 00:10:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:03,049 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 2 more)] === [2022-12-06 00:10:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1760833152, now seen corresponding path program 1 times [2022-12-06 00:10:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:03,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050785909] [2022-12-06 00:10:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:03,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050785909] [2022-12-06 00:10:03,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050785909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:03,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151361940] [2022-12-06 00:10:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:03,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:03,501 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 00:10:03,503 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 00:10:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:03,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:10:03,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:04,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:05,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:05,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 685 treesize of output 850 [2022-12-06 00:10:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:09,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151361940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:09,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:09,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:10:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031057256] [2022-12-06 00:10:09,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:09,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:10:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:10:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:10:09,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:09,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 521 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:09,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:09,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:09,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:11,846 INFO L130 PetriNetUnfolder]: 3839/5601 cut-off events. [2022-12-06 00:10:11,846 INFO L131 PetriNetUnfolder]: For 11508/11508 co-relation queries the response was YES. [2022-12-06 00:10:11,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19662 conditions, 5601 events. 3839/5601 cut-off events. For 11508/11508 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26638 event pairs, 642 based on Foata normal form. 360/5960 useless extension candidates. Maximal degree in co-relation 17702. Up to 1469 conditions per place. [2022-12-06 00:10:11,873 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 138 selfloop transitions, 37 changer transitions 35/210 dead transitions. [2022-12-06 00:10:11,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 210 transitions, 1530 flow [2022-12-06 00:10:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:10:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:10:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2022-12-06 00:10:11,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2022-12-06 00:10:11,874 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 521 flow. Second operand 12 states and 176 transitions. [2022-12-06 00:10:11,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 210 transitions, 1530 flow [2022-12-06 00:10:11,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 210 transitions, 1490 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 00:10:11,890 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 729 flow [2022-12-06 00:10:11,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2022-12-06 00:10:11,890 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2022-12-06 00:10:11,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:11,890 INFO L89 Accepts]: Start accepts. Operand has 88 places, 89 transitions, 729 flow [2022-12-06 00:10:11,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:11,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:11,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 89 transitions, 729 flow [2022-12-06 00:10:11,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 89 transitions, 729 flow [2022-12-06 00:10:11,953 INFO L130 PetriNetUnfolder]: 140/592 cut-off events. [2022-12-06 00:10:11,953 INFO L131 PetriNetUnfolder]: For 776/796 co-relation queries the response was YES. [2022-12-06 00:10:11,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 592 events. 140/592 cut-off events. For 776/796 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3867 event pairs, 58 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 1546. Up to 128 conditions per place. [2022-12-06 00:10:11,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 89 transitions, 729 flow [2022-12-06 00:10:11,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-06 00:10:23,693 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1659] L110-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork3_#t~nondet14#1=|v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1|} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_Out_4|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#t~nondet14#1] and [1611] L198-4-->L199-3: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t4~0#1.base_21| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t4~0#1.base_21|) |v_ULTIMATE.start_main_~#t4~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre49#1_25|)) |v_#memory_int_281|) (= |v_#pthreadsForks_56| |v_ULTIMATE.start_main_#t~pre49#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_282|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_21|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_25|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_15|, #memory_int=|v_#memory_int_281|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_21|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_21|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet48#1, #memory_int, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 00:10:23,743 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:10:23,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11854 [2022-12-06 00:10:23,744 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 752 flow [2022-12-06 00:10:23,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:23,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:23,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, 1, 1, 1, 1, 1] [2022-12-06 00:10:23,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:23,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:23,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 2 more)] === [2022-12-06 00:10:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2097075205, now seen corresponding path program 1 times [2022-12-06 00:10:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:23,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234535542] [2022-12-06 00:10:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:24,366 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 00:10:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:24,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234535542] [2022-12-06 00:10:24,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234535542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:24,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:24,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:24,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615078910] [2022-12-06 00:10:24,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:24,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:24,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:24,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:24,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:10:24,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:10:24,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 752 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:24,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:24,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:10:24,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:25,421 INFO L130 PetriNetUnfolder]: 5292/7965 cut-off events. [2022-12-06 00:10:25,421 INFO L131 PetriNetUnfolder]: For 23346/23346 co-relation queries the response was YES. [2022-12-06 00:10:25,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29529 conditions, 7965 events. 5292/7965 cut-off events. For 23346/23346 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42362 event pairs, 2803 based on Foata normal form. 16/7979 useless extension candidates. Maximal degree in co-relation 28527. Up to 3894 conditions per place. [2022-12-06 00:10:25,484 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 105 selfloop transitions, 27 changer transitions 25/157 dead transitions. [2022-12-06 00:10:25,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 157 transitions, 1423 flow [2022-12-06 00:10:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:10:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:10:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 00:10:25,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 00:10:25,486 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 752 flow. Second operand 6 states and 105 transitions. [2022-12-06 00:10:25,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 157 transitions, 1423 flow [2022-12-06 00:10:25,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 1358 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:25,533 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 869 flow [2022-12-06 00:10:25,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2022-12-06 00:10:25,533 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2022-12-06 00:10:25,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:25,533 INFO L89 Accepts]: Start accepts. Operand has 91 places, 97 transitions, 869 flow [2022-12-06 00:10:25,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:25,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:25,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 97 transitions, 869 flow [2022-12-06 00:10:25,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 869 flow [2022-12-06 00:10:25,619 INFO L130 PetriNetUnfolder]: 209/992 cut-off events. [2022-12-06 00:10:25,619 INFO L131 PetriNetUnfolder]: For 1164/1194 co-relation queries the response was YES. [2022-12-06 00:10:25,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 992 events. 209/992 cut-off events. For 1164/1194 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8032 event pairs, 117 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 2542. Up to 240 conditions per place. [2022-12-06 00:10:25,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 97 transitions, 869 flow [2022-12-06 00:10:25,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-06 00:10:25,629 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:25,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 00:10:25,631 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 869 flow [2022-12-06 00:10:25,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:25,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:25,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:25,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:10:25,632 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 2 more)] === [2022-12-06 00:10:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 346501392, now seen corresponding path program 1 times [2022-12-06 00:10:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:25,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708043578] [2022-12-06 00:10:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:25,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708043578] [2022-12-06 00:10:25,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708043578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:25,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953783654] [2022-12-06 00:10:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:25,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:25,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:25,907 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 00:10:25,914 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 00:10:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:26,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:10:26,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:26,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:26,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:26,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 00:10:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:27,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953783654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:27,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:27,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 00:10:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362290115] [2022-12-06 00:10:27,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:27,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:10:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:10:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:10:27,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:27,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 869 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 00:10:27,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:27,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:27,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:29,766 INFO L130 PetriNetUnfolder]: 8118/12267 cut-off events. [2022-12-06 00:10:29,767 INFO L131 PetriNetUnfolder]: For 38673/38673 co-relation queries the response was YES. [2022-12-06 00:10:29,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44471 conditions, 12267 events. 8118/12267 cut-off events. For 38673/38673 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 70639 event pairs, 3189 based on Foata normal form. 672/12938 useless extension candidates. Maximal degree in co-relation 43532. Up to 2847 conditions per place. [2022-12-06 00:10:29,830 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 181 selfloop transitions, 59 changer transitions 18/258 dead transitions. [2022-12-06 00:10:29,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 258 transitions, 2278 flow [2022-12-06 00:10:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:10:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:10:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2022-12-06 00:10:29,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.388560157790927 [2022-12-06 00:10:29,832 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 869 flow. Second operand 13 states and 197 transitions. [2022-12-06 00:10:29,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 258 transitions, 2278 flow [2022-12-06 00:10:29,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 258 transitions, 2244 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 00:10:29,914 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1133 flow [2022-12-06 00:10:29,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1133, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2022-12-06 00:10:29,915 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-06 00:10:29,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:29,915 INFO L89 Accepts]: Start accepts. Operand has 104 places, 108 transitions, 1133 flow [2022-12-06 00:10:29,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:29,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:29,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 108 transitions, 1133 flow [2022-12-06 00:10:29,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 108 transitions, 1133 flow [2022-12-06 00:10:30,087 INFO L130 PetriNetUnfolder]: 262/1373 cut-off events. [2022-12-06 00:10:30,087 INFO L131 PetriNetUnfolder]: For 1941/1993 co-relation queries the response was YES. [2022-12-06 00:10:30,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1373 events. 262/1373 cut-off events. For 1941/1993 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12267 event pairs, 152 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 3578. Up to 326 conditions per place. [2022-12-06 00:10:30,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 108 transitions, 1133 flow [2022-12-06 00:10:30,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-06 00:10:30,101 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:30,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:10:30,102 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 1133 flow [2022-12-06 00:10:30,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 00:10:30,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:30,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:30,108 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 00:10:30,303 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,SelfDestructingSolverStorable11 [2022-12-06 00:10:30,304 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 2 more)] === [2022-12-06 00:10:30,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1635500227, now seen corresponding path program 1 times [2022-12-06 00:10:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:30,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027498495] [2022-12-06 00:10:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027498495] [2022-12-06 00:10:30,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027498495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207096781] [2022-12-06 00:10:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:30,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:30,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:30,849 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 00:10:30,851 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 00:10:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:30,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:10:30,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:31,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:31,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:31,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 00:10:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207096781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:33,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:33,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-12-06 00:10:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645335239] [2022-12-06 00:10:33,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:33,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:10:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:33,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:10:33,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:10:33,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:33,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 1133 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 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 00:10:33,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:33,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:33,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:34,601 INFO L130 PetriNetUnfolder]: 7277/11112 cut-off events. [2022-12-06 00:10:34,601 INFO L131 PetriNetUnfolder]: For 34988/34988 co-relation queries the response was YES. [2022-12-06 00:10:34,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40673 conditions, 11112 events. 7277/11112 cut-off events. For 34988/34988 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 63862 event pairs, 3500 based on Foata normal form. 168/11279 useless extension candidates. Maximal degree in co-relation 39934. Up to 4933 conditions per place. [2022-12-06 00:10:34,644 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 78 selfloop transitions, 40 changer transitions 24/142 dead transitions. [2022-12-06 00:10:34,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1425 flow [2022-12-06 00:10:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:10:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:10:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 00:10:34,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34798534798534797 [2022-12-06 00:10:34,646 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 1133 flow. Second operand 7 states and 95 transitions. [2022-12-06 00:10:34,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1425 flow [2022-12-06 00:10:34,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 142 transitions, 1377 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 00:10:34,709 INFO L231 Difference]: Finished difference. Result has 102 places, 88 transitions, 934 flow [2022-12-06 00:10:34,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=934, PETRI_PLACES=102, PETRI_TRANSITIONS=88} [2022-12-06 00:10:34,710 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-06 00:10:34,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:34,710 INFO L89 Accepts]: Start accepts. Operand has 102 places, 88 transitions, 934 flow [2022-12-06 00:10:34,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:34,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:34,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 88 transitions, 934 flow [2022-12-06 00:10:34,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 934 flow [2022-12-06 00:10:34,824 INFO L130 PetriNetUnfolder]: 240/1251 cut-off events. [2022-12-06 00:10:34,824 INFO L131 PetriNetUnfolder]: For 1773/1813 co-relation queries the response was YES. [2022-12-06 00:10:34,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1251 events. 240/1251 cut-off events. For 1773/1813 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10879 event pairs, 144 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 3240. Up to 301 conditions per place. [2022-12-06 00:10:34,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 88 transitions, 934 flow [2022-12-06 00:10:34,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 00:10:34,835 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:34,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 00:10:34,836 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 934 flow [2022-12-06 00:10:34,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 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 00:10:34,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:34,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:34,856 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 00:10:35,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:35,042 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 2 more)] === [2022-12-06 00:10:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1944078593, now seen corresponding path program 1 times [2022-12-06 00:10:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:35,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129814571] [2022-12-06 00:10:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:36,437 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 00:10:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129814571] [2022-12-06 00:10:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129814571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678774578] [2022-12-06 00:10:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:36,439 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 00:10:36,439 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 00:10:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:36,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 00:10:36,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:36,742 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 00:10:36,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:37,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:37,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 439 treesize of output 630 [2022-12-06 00:10:42,004 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 00:10:42,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678774578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:42,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:42,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 13 [2022-12-06 00:10:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290201679] [2022-12-06 00:10:42,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:42,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:10:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:42,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:10:42,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:10:42,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:42,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 934 flow. Second operand has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:42,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:42,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:42,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:44,250 INFO L130 PetriNetUnfolder]: 8442/12922 cut-off events. [2022-12-06 00:10:44,250 INFO L131 PetriNetUnfolder]: For 36474/36474 co-relation queries the response was YES. [2022-12-06 00:10:44,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46873 conditions, 12922 events. 8442/12922 cut-off events. For 36474/36474 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 77420 event pairs, 2276 based on Foata normal form. 6/12927 useless extension candidates. Maximal degree in co-relation 46709. Up to 4437 conditions per place. [2022-12-06 00:10:44,305 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 110 selfloop transitions, 59 changer transitions 68/237 dead transitions. [2022-12-06 00:10:44,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 237 transitions, 2122 flow [2022-12-06 00:10:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:10:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:10:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2022-12-06 00:10:44,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31794871794871793 [2022-12-06 00:10:44,306 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 934 flow. Second operand 15 states and 186 transitions. [2022-12-06 00:10:44,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 237 transitions, 2122 flow [2022-12-06 00:10:44,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 237 transitions, 1966 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-12-06 00:10:44,420 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 1267 flow [2022-12-06 00:10:44,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1267, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2022-12-06 00:10:44,420 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2022-12-06 00:10:44,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:44,420 INFO L89 Accepts]: Start accepts. Operand has 105 places, 108 transitions, 1267 flow [2022-12-06 00:10:44,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:44,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:44,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 108 transitions, 1267 flow [2022-12-06 00:10:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 1267 flow [2022-12-06 00:10:44,563 INFO L130 PetriNetUnfolder]: 300/1576 cut-off events. [2022-12-06 00:10:44,563 INFO L131 PetriNetUnfolder]: For 2352/2368 co-relation queries the response was YES. [2022-12-06 00:10:44,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 1576 events. 300/1576 cut-off events. For 2352/2368 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14664 event pairs, 187 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 3870. Up to 386 conditions per place. [2022-12-06 00:10:44,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 108 transitions, 1267 flow [2022-12-06 00:10:44,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-06 00:11:00,919 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:11:00,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16499 [2022-12-06 00:11:00,919 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 1314 flow [2022-12-06 00:11:00,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:00,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:00,920 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:00,925 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 00:11:01,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:01,125 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 2 more)] === [2022-12-06 00:11:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:01,126 INFO L85 PathProgramCache]: Analyzing trace with hash -515373277, now seen corresponding path program 1 times [2022-12-06 00:11:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:01,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754665327] [2022-12-06 00:11:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:01,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:01,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754665327] [2022-12-06 00:11:01,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754665327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:01,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855764377] [2022-12-06 00:11:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:01,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:01,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:01,878 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 00:11:01,880 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 00:11:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:02,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:11:02,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:11:02,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:11:03,862 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-06 00:11:03,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1138 treesize of output 1258 [2022-12-06 00:11:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:11:27,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855764377] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:11:27,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:11:27,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 00:11:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227593169] [2022-12-06 00:11:27,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:11:27,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:11:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:11:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-12-06 00:11:27,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:11:27,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 1314 flow. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:27,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:27,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:11:27,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:29,338 INFO L130 PetriNetUnfolder]: 8238/12656 cut-off events. [2022-12-06 00:11:29,338 INFO L131 PetriNetUnfolder]: For 41806/41806 co-relation queries the response was YES. [2022-12-06 00:11:29,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46161 conditions, 12656 events. 8238/12656 cut-off events. For 41806/41806 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 75836 event pairs, 2508 based on Foata normal form. 112/12768 useless extension candidates. Maximal degree in co-relation 43463. Up to 3738 conditions per place. [2022-12-06 00:11:29,385 INFO L137 encePairwiseOnDemand]: 23/44 looper letters, 134 selfloop transitions, 67 changer transitions 90/291 dead transitions. [2022-12-06 00:11:29,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 291 transitions, 2633 flow [2022-12-06 00:11:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:11:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:11:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 240 transitions. [2022-12-06 00:11:29,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 00:11:29,387 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 1314 flow. Second operand 18 states and 240 transitions. [2022-12-06 00:11:29,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 291 transitions, 2633 flow [2022-12-06 00:11:29,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 291 transitions, 2488 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:29,546 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 1438 flow [2022-12-06 00:11:29,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1438, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2022-12-06 00:11:29,547 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-06 00:11:29,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:29,547 INFO L89 Accepts]: Start accepts. Operand has 121 places, 115 transitions, 1438 flow [2022-12-06 00:11:29,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:29,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:29,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 115 transitions, 1438 flow [2022-12-06 00:11:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 115 transitions, 1438 flow [2022-12-06 00:11:29,675 INFO L130 PetriNetUnfolder]: 288/1545 cut-off events. [2022-12-06 00:11:29,676 INFO L131 PetriNetUnfolder]: For 2586/2602 co-relation queries the response was YES. [2022-12-06 00:11:29,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1545 events. 288/1545 cut-off events. For 2586/2602 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14472 event pairs, 187 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 3830. Up to 383 conditions per place. [2022-12-06 00:11:29,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 115 transitions, 1438 flow [2022-12-06 00:11:29,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 00:11:29,733 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,734 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,735 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,735 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:29,735 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,108 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,108 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,108 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,109 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:33,110 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:11:37,186 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:11:37,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7639 [2022-12-06 00:11:37,186 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 1442 flow [2022-12-06 00:11:37,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:37,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:37,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:37,194 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 00:11:37,387 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,SelfDestructingSolverStorable14 [2022-12-06 00:11:37,387 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 2 more)] === [2022-12-06 00:11:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1794381854, now seen corresponding path program 1 times [2022-12-06 00:11:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:37,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453161479] [2022-12-06 00:11:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:11:37,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453161479] [2022-12-06 00:11:37,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453161479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473750890] [2022-12-06 00:11:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:37,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:37,934 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 00:11:37,936 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 00:11:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:38,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:11:38,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:11:38,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:11:38,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473750890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:38,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:11:38,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-12-06 00:11:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151713584] [2022-12-06 00:11:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:11:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:11:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:11:38,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:11:38,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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 00:11:38,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:38,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:11:38,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:39,837 INFO L130 PetriNetUnfolder]: 8952/13735 cut-off events. [2022-12-06 00:11:39,837 INFO L131 PetriNetUnfolder]: For 52072/52072 co-relation queries the response was YES. [2022-12-06 00:11:39,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50757 conditions, 13735 events. 8952/13735 cut-off events. For 52072/52072 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 84277 event pairs, 7556 based on Foata normal form. 144/13878 useless extension candidates. Maximal degree in co-relation 47976. Up to 11689 conditions per place. [2022-12-06 00:11:39,891 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 133 selfloop transitions, 9 changer transitions 4/146 dead transitions. [2022-12-06 00:11:39,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 146 transitions, 1959 flow [2022-12-06 00:11:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:11:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:11:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 00:11:39,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2022-12-06 00:11:39,892 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 1442 flow. Second operand 3 states and 73 transitions. [2022-12-06 00:11:39,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 146 transitions, 1959 flow [2022-12-06 00:11:40,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 146 transitions, 1773 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-12-06 00:11:40,095 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 1246 flow [2022-12-06 00:11:40,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2022-12-06 00:11:40,095 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-06 00:11:40,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:40,095 INFO L89 Accepts]: Start accepts. Operand has 108 places, 110 transitions, 1246 flow [2022-12-06 00:11:40,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:40,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:40,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 110 transitions, 1246 flow [2022-12-06 00:11:40,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 110 transitions, 1246 flow [2022-12-06 00:11:40,233 INFO L130 PetriNetUnfolder]: 290/1555 cut-off events. [2022-12-06 00:11:40,233 INFO L131 PetriNetUnfolder]: For 2206/2222 co-relation queries the response was YES. [2022-12-06 00:11:40,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4098 conditions, 1555 events. 290/1555 cut-off events. For 2206/2222 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14516 event pairs, 181 based on Foata normal form. 0/1525 useless extension candidates. Maximal degree in co-relation 3780. Up to 376 conditions per place. [2022-12-06 00:11:40,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 110 transitions, 1246 flow [2022-12-06 00:11:40,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-06 00:11:40,247 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:40,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 00:11:40,248 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 1246 flow [2022-12-06 00:11:40,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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 00:11:40,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:40,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:40,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:11:40,450 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,SelfDestructingSolverStorable15 [2022-12-06 00:11:40,451 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 2 more)] === [2022-12-06 00:11:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash -682394318, now seen corresponding path program 1 times [2022-12-06 00:11:40,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:40,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797988413] [2022-12-06 00:11:40,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797988413] [2022-12-06 00:11:41,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797988413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102981513] [2022-12-06 00:11:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:41,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:41,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:41,598 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 00:11:41,600 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 00:11:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:41,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 00:11:41,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:42,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:11:42,065 INFO L321 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2022-12-06 00:11:42,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 104 [2022-12-06 00:11:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:11:42,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:11:43,703 INFO L321 Elim1Store]: treesize reduction 240, result has 70.0 percent of original size [2022-12-06 00:11:43,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1907 treesize of output 2258 Received shutdown request... [2022-12-06 00:22:42,994 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 00:22:42,996 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 00:22:43,002 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 00:22:43,025 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:22:43,025 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 00:22:43,196 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,SelfDestructingSolverStorable16 [2022-12-06 00:22:43,197 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 22ms.. [2022-12-06 00:22:43,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 00:22:43,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 00:22:43,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 00:22:43,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 00:22:43,198 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:43,201 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:22:43,201 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:22:43,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:22:43 BasicIcfg [2022-12-06 00:22:43,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:22:43,203 INFO L158 Benchmark]: Toolchain (without parser) took 826975.27ms. Allocated memory was 185.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 161.6MB in the beginning and 758.3MB in the end (delta: -596.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 00:22:43,203 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 107.4MB in the beginning and 107.3MB in the end (delta: 88.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:22:43,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.44ms. Allocated memory is still 185.6MB. Free memory was 161.6MB in the beginning and 144.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:22:43,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.23ms. Allocated memory is still 185.6MB. Free memory was 144.7MB in the beginning and 141.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:22:43,203 INFO L158 Benchmark]: Boogie Preprocessor took 43.39ms. Allocated memory is still 185.6MB. Free memory was 141.2MB in the beginning and 138.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:22:43,203 INFO L158 Benchmark]: RCFGBuilder took 769.85ms. Allocated memory is still 185.6MB. Free memory was 138.5MB in the beginning and 155.7MB in the end (delta: -17.2MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. [2022-12-06 00:22:43,204 INFO L158 Benchmark]: TraceAbstraction took 825828.42ms. Allocated memory was 185.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 155.2MB in the beginning and 758.3MB in the end (delta: -603.1MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 00:22:43,205 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 107.4MB in the beginning and 107.3MB in the end (delta: 88.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.44ms. Allocated memory is still 185.6MB. Free memory was 161.6MB in the beginning and 144.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.23ms. Allocated memory is still 185.6MB. Free memory was 144.7MB in the beginning and 141.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.39ms. Allocated memory is still 185.6MB. Free memory was 141.2MB in the beginning and 138.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 769.85ms. Allocated memory is still 185.6MB. Free memory was 138.5MB in the beginning and 155.7MB in the end (delta: -17.2MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. * TraceAbstraction took 825828.42ms. Allocated memory was 185.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 155.2MB in the beginning and 758.3MB in the end (delta: -603.1MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.3s, 291 PlacesBefore, 38 PlacesAfterwards, 315 TransitionsBefore, 33 TransitionsAfterwards, 5184 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 196 TrivialYvCompositions, 57 ConcurrentYvCompositions, 21 ChoiceCompositions, 274 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 3610, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 4536, Positive cache size: 4536, Positive conditional cache size: 0, Positive unconditional cache size: 4536, 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, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 228 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, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 204 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: 5.1s, 39 PlacesBefore, 39 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 204 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, 42 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 204 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, 39 PlacesBefore, 39 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 204 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, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 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.7s, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 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): 20, Positive cache size: 20, Positive conditional cache size: 20, 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: 31.5s, 74 PlacesBefore, 72 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 87 PlacesBefore, 87 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 598 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): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 650 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): 31, Positive cache size: 31, Positive conditional cache size: 31, 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, 94 PlacesBefore, 94 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 492 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): 31, Positive cache size: 31, Positive conditional cache size: 31, 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: 16.3s, 105 PlacesBefore, 105 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 119 PlacesBefore, 118 PlacesAfterwards, 115 TransitionsBefore, 114 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 784 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): 51, Positive cache size: 51, Positive conditional cache size: 51, 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: 206]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 22ms.. - TimeoutResultAtElement [Line: 196]: 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 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 22ms.. - TimeoutResultAtElement [Line: 197]: 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 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 22ms.. - TimeoutResultAtElement [Line: 198]: 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 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 22ms.. - TimeoutResultAtElement [Line: 199]: 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 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 22ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 347 locations, 5 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: 825.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 94 mSolverCounterUnknown, 2583 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2583 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3385 IncrementalHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 0 mSDtfsCounter, 3385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 360 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1442occurred in iteration=15, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 51.2s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 799 ConstructedInterpolants, 22 QuantifiedInterpolants, 14601 SizeOfPredicates, 379 NumberOfNonLiveVariables, 3537 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 43/81 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