/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:11:55,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:11:55,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:11:55,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:11:55,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:11:55,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:11:55,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:11:55,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:11:55,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:11:55,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:11:55,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:11:55,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:11:55,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:11:55,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:11:55,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:11:55,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:11:55,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:11:55,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:11:55,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:11:55,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:11:55,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:11:55,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:11:55,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:11:55,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:11:55,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:11:55,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:11:55,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:11:55,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:11:55,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:11:55,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:11:55,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:11:55,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:11:55,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:11:55,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:11:55,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:11:55,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:11:55,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:11:55,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:11:55,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:11:55,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:11:55,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:11:55,678 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:11:55,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:11:55,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:11:55,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:11:55,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:11:55,703 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:11:55,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:11:55,703 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:11:55,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:11:55,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:11:55,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:11:55,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:11:55,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:11:55,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:11:55,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:11:55,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:11:55,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:11:55,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:11:55,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:11:55,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:11:55,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:11:55,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:11:55,706 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-13 13:11:55,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:11:55,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:11:55,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:11:55,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:11:55,961 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:11:55,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-12-13 13:11:56,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:11:57,164 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:11:57,164 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-12-13 13:11:57,169 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da61af5e/5a41fec6aa354e7ca475051d19073d70/FLAGf9ac53a4c [2022-12-13 13:11:57,181 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da61af5e/5a41fec6aa354e7ca475051d19073d70 [2022-12-13 13:11:57,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:11:57,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:11:57,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:11:57,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:11:57,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:11:57,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530ca692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57, skipping insertion in model container [2022-12-13 13:11:57,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:11:57,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:11:57,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:11:57,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:11:57,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:11:57,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:11:57,354 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-figure1.wvr.c[1991,2004] [2022-12-13 13:11:57,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:11:57,363 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:11:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:11:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:11:57,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:11:57,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:11:57,377 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-figure1.wvr.c[1991,2004] [2022-12-13 13:11:57,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:11:57,388 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:11:57,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57 WrapperNode [2022-12-13 13:11:57,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:11:57,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:11:57,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:11:57,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:11:57,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,422 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2022-12-13 13:11:57,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:11:57,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:11:57,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:11:57,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:11:57,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,456 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:11:57,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:11:57,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:11:57,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:11:57,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (1/1) ... [2022-12-13 13:11:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:11:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:11:57,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:11:57,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:11:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:11:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:11:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:11:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:11:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:11:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:11:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:11:57,512 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:11:57,570 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:11:57,571 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:11:57,761 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:11:57,798 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:11:57,798 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 13:11:57,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:11:57 BoogieIcfgContainer [2022-12-13 13:11:57,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:11:57,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:11:57,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:11:57,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:11:57,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:11:57" (1/3) ... [2022-12-13 13:11:57,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18058a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:11:57, skipping insertion in model container [2022-12-13 13:11:57,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:11:57" (2/3) ... [2022-12-13 13:11:57,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18058a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:11:57, skipping insertion in model container [2022-12-13 13:11:57,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:11:57" (3/3) ... [2022-12-13 13:11:57,808 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1.wvr.c [2022-12-13 13:11:57,821 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:11:57,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:11:57,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:11:57,859 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 13:11:57,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 72 transitions, 160 flow [2022-12-13 13:11:57,915 INFO L130 PetriNetUnfolder]: 5/70 cut-off events. [2022-12-13 13:11:57,916 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:11:57,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 5/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-12-13 13:11:57,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 72 transitions, 160 flow [2022-12-13 13:11:57,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 62 transitions, 136 flow [2022-12-13 13:11:57,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:11:57,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 136 flow [2022-12-13 13:11:57,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 136 flow [2022-12-13 13:11:57,957 INFO L130 PetriNetUnfolder]: 5/62 cut-off events. [2022-12-13 13:11:57,958 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:11:57,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 5/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-12-13 13:11:57,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 136 flow [2022-12-13 13:11:57,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 13:11:59,429 INFO L241 LiptonReduction]: Total number of compositions: 47 [2022-12-13 13:11:59,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:11:59,449 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;@e55450a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:11:59,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 13:11:59,459 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 13:11:59,459 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:11:59,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:11:59,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:11:59,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:11:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:11:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1113892720, now seen corresponding path program 1 times [2022-12-13 13:11:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:11:59,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898400905] [2022-12-13 13:11:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:11:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:11:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:11:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:11:59,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:11:59,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898400905] [2022-12-13 13:11:59,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898400905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:11:59,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:11:59,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:11:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137382029] [2022-12-13 13:11:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:11:59,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:11:59,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:11:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:11:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:11:59,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 13:11:59,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:11:59,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:11:59,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 13:11:59,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:11:59,855 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-13 13:11:59,855 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 13:11:59,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 271 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-13 13:11:59,858 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-13 13:11:59,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-13 13:11:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:11:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:11:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 13:11:59,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 13:11:59,867 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-13 13:11:59,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 113 flow [2022-12-13 13:11:59,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:11:59,872 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 48 flow [2022-12-13 13:11:59,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-13 13:11:59,877 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-13 13:11:59,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:11:59,877 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 13:11:59,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:11:59,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:11:59,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 13:11:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 13:11:59,893 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 13:11:59,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:11:59,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 7 conditions per place. [2022-12-13 13:11:59,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 13:11:59,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 13:11:59,897 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:11:59,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 13:11:59,898 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 48 flow [2022-12-13 13:11:59,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:11:59,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:11:59,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:11:59,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:11:59,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:11:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:11:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash -756344514, now seen corresponding path program 1 times [2022-12-13 13:11:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:11:59,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003881927] [2022-12-13 13:11:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:11:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:11:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:11:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:11:59,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:11:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003881927] [2022-12-13 13:11:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003881927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:11:59,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:11:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:11:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225680451] [2022-12-13 13:11:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:11:59,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:11:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:11:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:11:59,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:11:59,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:11:59,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:11:59,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:11:59,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:11:59,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:00,065 INFO L130 PetriNetUnfolder]: 76/153 cut-off events. [2022-12-13 13:12:00,066 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 13:12:00,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 153 events. 76/153 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 469 event pairs, 24 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 183. Up to 78 conditions per place. [2022-12-13 13:12:00,067 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 30 selfloop transitions, 3 changer transitions 6/39 dead transitions. [2022-12-13 13:12:00,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 191 flow [2022-12-13 13:12:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 13:12:00,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 13:12:00,068 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 48 flow. Second operand 5 states and 37 transitions. [2022-12-13 13:12:00,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 191 flow [2022-12-13 13:12:00,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 39 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:00,069 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 70 flow [2022-12-13 13:12:00,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-13 13:12:00,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-13 13:12:00,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:00,070 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 70 flow [2022-12-13 13:12:00,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:00,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:00,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 70 flow [2022-12-13 13:12:00,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 70 flow [2022-12-13 13:12:00,074 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 13:12:00,074 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:12:00,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 31. Up to 8 conditions per place. [2022-12-13 13:12:00,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 70 flow [2022-12-13 13:12:00,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 13:12:00,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:00,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 13:12:00,171 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 67 flow [2022-12-13 13:12:00,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:00,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:00,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:12:00,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1067471298, now seen corresponding path program 1 times [2022-12-13 13:12:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299109655] [2022-12-13 13:12:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:00,238 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-13 13:12:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:00,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299109655] [2022-12-13 13:12:00,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299109655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:00,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333930943] [2022-12-13 13:12:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:00,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:00,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:00,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:00,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:12:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:00,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:12:00,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:00,380 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-13 13:12:00,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:00,395 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-13 13:12:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333930943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:00,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:00,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 13:12:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263599380] [2022-12-13 13:12:00,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:00,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:12:00,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 13:12:00,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:00,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 13:12:00,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:00,465 INFO L130 PetriNetUnfolder]: 49/105 cut-off events. [2022-12-13 13:12:00,465 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 13:12:00,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 105 events. 49/105 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 274 event pairs, 13 based on Foata normal form. 6/111 useless extension candidates. Maximal degree in co-relation 105. Up to 68 conditions per place. [2022-12-13 13:12:00,467 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 21 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2022-12-13 13:12:00,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 154 flow [2022-12-13 13:12:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-13 13:12:00,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.453125 [2022-12-13 13:12:00,476 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 67 flow. Second operand 4 states and 29 transitions. [2022-12-13 13:12:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 154 flow [2022-12-13 13:12:00,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 138 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:00,478 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 61 flow [2022-12-13 13:12:00,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=61, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2022-12-13 13:12:00,478 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-13 13:12:00,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:00,478 INFO L89 Accepts]: Start accepts. Operand has 24 places, 17 transitions, 61 flow [2022-12-13 13:12:00,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:00,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:00,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 17 transitions, 61 flow [2022-12-13 13:12:00,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 61 flow [2022-12-13 13:12:00,482 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-13 13:12:00,483 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 13:12:00,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 30 events. 4/30 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 10 conditions per place. [2022-12-13 13:12:00,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 61 flow [2022-12-13 13:12:00,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 13:12:00,484 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:00,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 13:12:00,485 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 61 flow [2022-12-13 13:12:00,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:00,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:00,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:00,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:00,690 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1130107994, now seen corresponding path program 2 times [2022-12-13 13:12:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:00,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98685499] [2022-12-13 13:12:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:00,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98685499] [2022-12-13 13:12:00,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98685499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:00,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:00,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:12:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422444186] [2022-12-13 13:12:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:00,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:00,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 13:12:00,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:00,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 13:12:00,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:00,769 INFO L130 PetriNetUnfolder]: 45/93 cut-off events. [2022-12-13 13:12:00,769 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 13:12:00,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 93 events. 45/93 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 223 event pairs, 21 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 130. Up to 65 conditions per place. [2022-12-13 13:12:00,771 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 17 selfloop transitions, 2 changer transitions 11/30 dead transitions. [2022-12-13 13:12:00,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 159 flow [2022-12-13 13:12:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 13:12:00,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-13 13:12:00,773 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 61 flow. Second operand 4 states and 31 transitions. [2022-12-13 13:12:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 159 flow [2022-12-13 13:12:00,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:00,775 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 60 flow [2022-12-13 13:12:00,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-13 13:12:00,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-13 13:12:00,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:00,777 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 60 flow [2022-12-13 13:12:00,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:00,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:00,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 60 flow [2022-12-13 13:12:00,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 60 flow [2022-12-13 13:12:00,782 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-13 13:12:00,783 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:12:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 17 events. 3/17 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 25. Up to 7 conditions per place. [2022-12-13 13:12:00,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 60 flow [2022-12-13 13:12:00,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 13:12:00,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:00,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 13:12:00,808 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 54 flow [2022-12-13 13:12:00,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:00,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:00,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:12:00,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1896266631, now seen corresponding path program 1 times [2022-12-13 13:12:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10368367] [2022-12-13 13:12:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:00,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10368367] [2022-12-13 13:12:00,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10368367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:00,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:00,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:12:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025461893] [2022-12-13 13:12:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:00,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:00,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:12:00,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:00,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:12:00,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:00,969 INFO L130 PetriNetUnfolder]: 70/136 cut-off events. [2022-12-13 13:12:00,969 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 13:12:00,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 136 events. 70/136 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 401 event pairs, 12 based on Foata normal form. 7/143 useless extension candidates. Maximal degree in co-relation 181. Up to 61 conditions per place. [2022-12-13 13:12:00,971 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 26 selfloop transitions, 6 changer transitions 4/36 dead transitions. [2022-12-13 13:12:00,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 36 transitions, 188 flow [2022-12-13 13:12:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 13:12:00,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 13:12:00,973 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 54 flow. Second operand 4 states and 38 transitions. [2022-12-13 13:12:00,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 36 transitions, 188 flow [2022-12-13 13:12:00,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 36 transitions, 171 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 13:12:00,975 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 91 flow [2022-12-13 13:12:00,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 13:12:00,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-13 13:12:00,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:00,977 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 91 flow [2022-12-13 13:12:00,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:00,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:00,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 91 flow [2022-12-13 13:12:00,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 91 flow [2022-12-13 13:12:00,982 INFO L130 PetriNetUnfolder]: 5/31 cut-off events. [2022-12-13 13:12:00,982 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-13 13:12:00,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 31 events. 5/31 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2022-12-13 13:12:00,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 91 flow [2022-12-13 13:12:00,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 13:12:00,983 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:00,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 13:12:00,986 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 91 flow [2022-12-13 13:12:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:00,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:00,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:00,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:12:00,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash 270986247, now seen corresponding path program 1 times [2022-12-13 13:12:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:00,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109615372] [2022-12-13 13:12:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:01,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109615372] [2022-12-13 13:12:01,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109615372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:01,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:01,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:12:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760585106] [2022-12-13 13:12:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:01,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:12:01,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:12:01,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:01,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:01,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:12:01,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:01,114 INFO L130 PetriNetUnfolder]: 78/157 cut-off events. [2022-12-13 13:12:01,114 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 13:12:01,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 157 events. 78/157 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 474 event pairs, 38 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 191. Up to 117 conditions per place. [2022-12-13 13:12:01,116 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 21 selfloop transitions, 4 changer transitions 15/40 dead transitions. [2022-12-13 13:12:01,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 235 flow [2022-12-13 13:12:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-13 13:12:01,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 13:12:01,117 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 91 flow. Second operand 6 states and 38 transitions. [2022-12-13 13:12:01,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 235 flow [2022-12-13 13:12:01,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 225 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 13:12:01,120 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 123 flow [2022-12-13 13:12:01,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 13:12:01,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 13:12:01,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:01,122 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 123 flow [2022-12-13 13:12:01,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:01,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:01,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 123 flow [2022-12-13 13:12:01,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 123 flow [2022-12-13 13:12:01,128 INFO L130 PetriNetUnfolder]: 9/41 cut-off events. [2022-12-13 13:12:01,128 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-13 13:12:01,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 41 events. 9/41 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 94. Up to 15 conditions per place. [2022-12-13 13:12:01,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 123 flow [2022-12-13 13:12:01,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 13:12:01,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] $Ultimate##0-->L41-4: Formula: (and (< 0 v_~N~0_57) (= v_thread1Thread1of1ForFork0_~i~0_35 1) (= (+ v_~counter~0_100 1) v_~counter~0_99)) InVars {~counter~0=v_~counter~0_100, ~N~0=v_~N~0_57} OutVars{~counter~0=v_~counter~0_99, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_24|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_18|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, ~N~0=v_~N~0_57} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [267] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (< 0 v_~counter~0_95) 1 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_33|) (= v_~counter~0_95 (+ v_~counter~0_94 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)) (< 0 v_~N~0_55)) InVars {~counter~0=v_~counter~0_95, ~N~0=v_~N~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_94, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_33|, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:01,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [270] $Ultimate##0-->L51-4: Formula: (and (< 0 v_~N~0_61) (= (ite (< 0 (+ v_~counter~0_109 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|) (= v_thread1Thread1of1ForFork0_~i~0_43 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18| 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_39|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|) (= v_~counter~0_109 v_~counter~0_111)) InVars {~counter~0=v_~counter~0_111, ~N~0=v_~N~0_61} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18|, ~counter~0=v_~counter~0_109, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_18|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_24|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_43, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_22|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_39|, ~N~0=v_~N~0_61} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:01,296 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:12:01,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 13:12:01,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 123 flow [2022-12-13 13:12:01,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:01,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:01,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:01,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:12:01,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 425929402, now seen corresponding path program 1 times [2022-12-13 13:12:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:01,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253358865] [2022-12-13 13:12:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253358865] [2022-12-13 13:12:01,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253358865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:01,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:01,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:12:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957255434] [2022-12-13 13:12:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:01,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:01,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:12:01,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:01,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:01,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:12:01,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:01,398 INFO L130 PetriNetUnfolder]: 79/151 cut-off events. [2022-12-13 13:12:01,398 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-13 13:12:01,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 151 events. 79/151 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 419 event pairs, 21 based on Foata normal form. 12/159 useless extension candidates. Maximal degree in co-relation 435. Up to 115 conditions per place. [2022-12-13 13:12:01,399 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 25 selfloop transitions, 5 changer transitions 1/31 dead transitions. [2022-12-13 13:12:01,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 232 flow [2022-12-13 13:12:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-13 13:12:01,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-13 13:12:01,401 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 123 flow. Second operand 4 states and 27 transitions. [2022-12-13 13:12:01,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 232 flow [2022-12-13 13:12:01,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 217 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:01,403 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 132 flow [2022-12-13 13:12:01,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-13 13:12:01,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-13 13:12:01,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:01,403 INFO L89 Accepts]: Start accepts. Operand has 30 places, 21 transitions, 132 flow [2022-12-13 13:12:01,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:01,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:01,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 132 flow [2022-12-13 13:12:01,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 132 flow [2022-12-13 13:12:01,407 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-13 13:12:01,407 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-13 13:12:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 46 events. 11/46 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 111 event pairs, 4 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 100. Up to 15 conditions per place. [2022-12-13 13:12:01,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 132 flow [2022-12-13 13:12:01,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-13 13:12:01,417 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:01,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 13:12:01,418 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 132 flow [2022-12-13 13:12:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:01,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:01,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:01,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:12:01,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1198607735, now seen corresponding path program 1 times [2022-12-13 13:12:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:01,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937689572] [2022-12-13 13:12:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:01,510 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-13 13:12:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937689572] [2022-12-13 13:12:01,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937689572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560772237] [2022-12-13 13:12:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:01,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:01,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:12:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:01,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:12:01,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:01,593 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-13 13:12:01,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:01,623 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-13 13:12:01,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560772237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:01,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:01,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 13:12:01,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718585892] [2022-12-13 13:12:01,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:01,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:12:01,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 13:12:01,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 132 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:01,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:01,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 13:12:01,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:01,698 INFO L130 PetriNetUnfolder]: 146/277 cut-off events. [2022-12-13 13:12:01,698 INFO L131 PetriNetUnfolder]: For 506/506 co-relation queries the response was YES. [2022-12-13 13:12:01,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 277 events. 146/277 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1044 event pairs, 20 based on Foata normal form. 7/284 useless extension candidates. Maximal degree in co-relation 387. Up to 89 conditions per place. [2022-12-13 13:12:01,700 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 34 selfloop transitions, 15 changer transitions 4/53 dead transitions. [2022-12-13 13:12:01,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 391 flow [2022-12-13 13:12:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 13:12:01,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 13:12:01,702 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 132 flow. Second operand 5 states and 48 transitions. [2022-12-13 13:12:01,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 391 flow [2022-12-13 13:12:01,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 361 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:01,705 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 233 flow [2022-12-13 13:12:01,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2022-12-13 13:12:01,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 13:12:01,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:01,707 INFO L89 Accepts]: Start accepts. Operand has 34 places, 29 transitions, 233 flow [2022-12-13 13:12:01,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:01,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:01,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 29 transitions, 233 flow [2022-12-13 13:12:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 233 flow [2022-12-13 13:12:01,713 INFO L130 PetriNetUnfolder]: 19/83 cut-off events. [2022-12-13 13:12:01,713 INFO L131 PetriNetUnfolder]: For 71/73 co-relation queries the response was YES. [2022-12-13 13:12:01,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 83 events. 19/83 cut-off events. For 71/73 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 334 event pairs, 7 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 190. Up to 26 conditions per place. [2022-12-13 13:12:01,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 233 flow [2022-12-13 13:12:01,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 13:12:01,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:01,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 13:12:01,717 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 233 flow [2022-12-13 13:12:01,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:01,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:01,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:01,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:01,921 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,SelfDestructingSolverStorable7 [2022-12-13 13:12:01,922 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash -479251786, now seen corresponding path program 1 times [2022-12-13 13:12:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:01,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451422572] [2022-12-13 13:12:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:01,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451422572] [2022-12-13 13:12:01,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451422572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:01,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795388306] [2022-12-13 13:12:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:01,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:01,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:12:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:02,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:02,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:02,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:02,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795388306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:02,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:02,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:12:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588707543] [2022-12-13 13:12:02,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:02,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:12:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:12:02,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:02,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 13:12:02,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 233 flow. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:02,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:02,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 13:12:02,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:02,163 INFO L130 PetriNetUnfolder]: 192/361 cut-off events. [2022-12-13 13:12:02,163 INFO L131 PetriNetUnfolder]: For 1054/1054 co-relation queries the response was YES. [2022-12-13 13:12:02,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 361 events. 192/361 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1465 event pairs, 88 based on Foata normal form. 26/387 useless extension candidates. Maximal degree in co-relation 651. Up to 294 conditions per place. [2022-12-13 13:12:02,165 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 43 selfloop transitions, 11 changer transitions 4/58 dead transitions. [2022-12-13 13:12:02,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 535 flow [2022-12-13 13:12:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 13:12:02,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 13:12:02,166 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 233 flow. Second operand 6 states and 40 transitions. [2022-12-13 13:12:02,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 535 flow [2022-12-13 13:12:02,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 473 flow, removed 31 selfloop flow, removed 0 redundant places. [2022-12-13 13:12:02,169 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 338 flow [2022-12-13 13:12:02,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2022-12-13 13:12:02,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 13:12:02,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:02,170 INFO L89 Accepts]: Start accepts. Operand has 43 places, 38 transitions, 338 flow [2022-12-13 13:12:02,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:02,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:02,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 38 transitions, 338 flow [2022-12-13 13:12:02,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 338 flow [2022-12-13 13:12:02,181 INFO L130 PetriNetUnfolder]: 30/118 cut-off events. [2022-12-13 13:12:02,181 INFO L131 PetriNetUnfolder]: For 236/250 co-relation queries the response was YES. [2022-12-13 13:12:02,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 118 events. 30/118 cut-off events. For 236/250 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 563 event pairs, 7 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 343. Up to 38 conditions per place. [2022-12-13 13:12:02,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 38 transitions, 338 flow [2022-12-13 13:12:02,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-13 13:12:02,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] $Ultimate##0-->L41-4: Formula: (and (= 2 v_thread1Thread1of1ForFork0_~i~0_45) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_20| 0)) (< v_thread1Thread1of1ForFork0_~i~0_45 (+ 1 v_~N~0_63)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_20| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|) (= (ite (< 0 v_~counter~0_115) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|) (= v_~counter~0_115 (+ v_~counter~0_117 1))) InVars {~counter~0=v_~counter~0_117, ~N~0=v_~N~0_63} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_20|, ~counter~0=v_~counter~0_115, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_20|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_32|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_26|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_45, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_24|, ~N~0=v_~N~0_63, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:02,261 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:02,261 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:02,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:02,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:02,518 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:12:02,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-13 13:12:02,518 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 366 flow [2022-12-13 13:12:02,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:02,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:02,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:02,529 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-13 13:12:02,719 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-13 13:12:02,719 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -195317178, now seen corresponding path program 1 times [2022-12-13 13:12:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:02,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584108039] [2022-12-13 13:12:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:02,759 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-13 13:12:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584108039] [2022-12-13 13:12:02,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584108039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940427630] [2022-12-13 13:12:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:02,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:02,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:02,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:02,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:12:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:02,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:12:02,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:02,859 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-13 13:12:02,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:02,887 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-13 13:12:02,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940427630] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:02,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:02,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 13:12:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318372339] [2022-12-13 13:12:02,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:02,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:02,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 13:12:02,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:02,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:02,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 13:12:02,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:03,013 INFO L130 PetriNetUnfolder]: 232/476 cut-off events. [2022-12-13 13:12:03,013 INFO L131 PetriNetUnfolder]: For 1710/1710 co-relation queries the response was YES. [2022-12-13 13:12:03,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 476 events. 232/476 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2282 event pairs, 104 based on Foata normal form. 18/492 useless extension candidates. Maximal degree in co-relation 1366. Up to 344 conditions per place. [2022-12-13 13:12:03,016 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 53 selfloop transitions, 11 changer transitions 11/75 dead transitions. [2022-12-13 13:12:03,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 722 flow [2022-12-13 13:12:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:12:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:12:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-13 13:12:03,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2022-12-13 13:12:03,017 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 366 flow. Second operand 7 states and 53 transitions. [2022-12-13 13:12:03,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 722 flow [2022-12-13 13:12:03,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 664 flow, removed 29 selfloop flow, removed 0 redundant places. [2022-12-13 13:12:03,021 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 386 flow [2022-12-13 13:12:03,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-13 13:12:03,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 32 predicate places. [2022-12-13 13:12:03,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:03,021 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 386 flow [2022-12-13 13:12:03,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:03,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:03,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 386 flow [2022-12-13 13:12:03,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 386 flow [2022-12-13 13:12:03,032 INFO L130 PetriNetUnfolder]: 34/158 cut-off events. [2022-12-13 13:12:03,032 INFO L131 PetriNetUnfolder]: For 404/423 co-relation queries the response was YES. [2022-12-13 13:12:03,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 158 events. 34/158 cut-off events. For 404/423 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 879 event pairs, 8 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 474. Up to 48 conditions per place. [2022-12-13 13:12:03,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 386 flow [2022-12-13 13:12:03,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 13:12:03,037 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:03,038 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:03,157 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:03,158 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:03,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:03,323 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:12:03,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-13 13:12:03,324 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 419 flow [2022-12-13 13:12:03,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:03,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:03,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:03,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:03,528 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-13 13:12:03,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1087065918, now seen corresponding path program 2 times [2022-12-13 13:12:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:03,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307254127] [2022-12-13 13:12:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307254127] [2022-12-13 13:12:03,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307254127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:03,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:03,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:12:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517918709] [2022-12-13 13:12:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:03,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:12:03,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:03,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:03,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:12:03,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:03,653 INFO L130 PetriNetUnfolder]: 209/411 cut-off events. [2022-12-13 13:12:03,654 INFO L131 PetriNetUnfolder]: For 1766/1766 co-relation queries the response was YES. [2022-12-13 13:12:03,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 411 events. 209/411 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1820 event pairs, 111 based on Foata normal form. 2/413 useless extension candidates. Maximal degree in co-relation 1640. Up to 391 conditions per place. [2022-12-13 13:12:03,656 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 39 selfloop transitions, 3 changer transitions 8/50 dead transitions. [2022-12-13 13:12:03,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 545 flow [2022-12-13 13:12:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 13:12:03,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 13:12:03,658 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 419 flow. Second operand 4 states and 32 transitions. [2022-12-13 13:12:03,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 545 flow [2022-12-13 13:12:03,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 494 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:03,661 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 363 flow [2022-12-13 13:12:03,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-13 13:12:03,662 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2022-12-13 13:12:03,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:03,662 INFO L89 Accepts]: Start accepts. Operand has 50 places, 41 transitions, 363 flow [2022-12-13 13:12:03,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:03,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:03,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 363 flow [2022-12-13 13:12:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 363 flow [2022-12-13 13:12:03,675 INFO L130 PetriNetUnfolder]: 33/139 cut-off events. [2022-12-13 13:12:03,675 INFO L131 PetriNetUnfolder]: For 326/342 co-relation queries the response was YES. [2022-12-13 13:12:03,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 139 events. 33/139 cut-off events. For 326/342 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 715 event pairs, 6 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 435. Up to 43 conditions per place. [2022-12-13 13:12:03,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 363 flow [2022-12-13 13:12:03,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-13 13:12:03,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (+ v_~counter~0_136 1)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_51|) (= v_~counter~0_136 v_~counter~0_138) (< 1 v_~N~0_67) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (= 2 v_thread1Thread1of1ForFork0_~i~0_57) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|))) InVars {~counter~0=v_~counter~0_138, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, ~counter~0=v_~counter~0_136, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_44|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L41-4-->L51-4: Formula: (and (= v_~counter~0_166 v_~counter~0_164) (= v_thread1Thread1of1ForFork0_~i~0_69 (+ v_thread1Thread1of1ForFork0_~i~0_70 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_77| v_~N~0_77) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_77|) |v_thread2Thread1of1ForFork1_~i~1#1_76|) (= (ite (< 0 (+ v_~counter~0_164 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|) (< v_thread1Thread1of1ForFork0_~i~0_70 v_~N~0_77) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46| 0))) InVars {~counter~0=v_~counter~0_166, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_70, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_77|, ~N~0=v_~N~0_77} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46|, ~counter~0=v_~counter~0_164, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_48|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_42|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_69, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_50|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_76|, ~N~0=v_~N~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:03,682 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:03,682 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:03,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (+ v_~counter~0_136 1)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_51|) (= v_~counter~0_136 v_~counter~0_138) (< 1 v_~N~0_67) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (= 2 v_thread1Thread1of1ForFork0_~i~0_57) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|))) InVars {~counter~0=v_~counter~0_138, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, ~counter~0=v_~counter~0_136, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_44|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:03,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:03,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 13:12:03,859 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 375 flow [2022-12-13 13:12:03,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:03,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:03,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:03,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:12:03,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 24471071, now seen corresponding path program 1 times [2022-12-13 13:12:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:03,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102385278] [2022-12-13 13:12:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:03,884 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-13 13:12:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102385278] [2022-12-13 13:12:03,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102385278] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570471524] [2022-12-13 13:12:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:03,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:03,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:12:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:03,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:12:03,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:03,945 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-13 13:12:03,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:03,953 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-13 13:12:03,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570471524] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:03,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:03,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-13 13:12:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801965888] [2022-12-13 13:12:03,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:12:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:12:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:12:03,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:12:03,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:03,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:03,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:12:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:04,046 INFO L130 PetriNetUnfolder]: 248/504 cut-off events. [2022-12-13 13:12:04,046 INFO L131 PetriNetUnfolder]: For 2328/2328 co-relation queries the response was YES. [2022-12-13 13:12:04,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 504 events. 248/504 cut-off events. For 2328/2328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2437 event pairs, 101 based on Foata normal form. 18/522 useless extension candidates. Maximal degree in co-relation 2166. Up to 337 conditions per place. [2022-12-13 13:12:04,049 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 48 selfloop transitions, 17 changer transitions 8/73 dead transitions. [2022-12-13 13:12:04,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 719 flow [2022-12-13 13:12:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 13:12:04,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-13 13:12:04,050 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 375 flow. Second operand 6 states and 51 transitions. [2022-12-13 13:12:04,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 719 flow [2022-12-13 13:12:04,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 696 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:04,055 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 486 flow [2022-12-13 13:12:04,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2022-12-13 13:12:04,056 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 13:12:04,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:04,056 INFO L89 Accepts]: Start accepts. Operand has 56 places, 47 transitions, 486 flow [2022-12-13 13:12:04,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:04,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:04,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 47 transitions, 486 flow [2022-12-13 13:12:04,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 486 flow [2022-12-13 13:12:04,068 INFO L130 PetriNetUnfolder]: 37/179 cut-off events. [2022-12-13 13:12:04,068 INFO L131 PetriNetUnfolder]: For 607/634 co-relation queries the response was YES. [2022-12-13 13:12:04,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 179 events. 37/179 cut-off events. For 607/634 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1053 event pairs, 8 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 620. Up to 53 conditions per place. [2022-12-13 13:12:04,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 486 flow [2022-12-13 13:12:04,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-13 13:12:04,077 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:04,077 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:04,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:04,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 13:12:04,209 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 489 flow [2022-12-13 13:12:04,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:04,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:04,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:04,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:04,417 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-13 13:12:04,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:04,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1713325209, now seen corresponding path program 2 times [2022-12-13 13:12:04,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:04,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794745949] [2022-12-13 13:12:04,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:04,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794745949] [2022-12-13 13:12:04,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794745949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:04,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:04,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:12:04,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93722631] [2022-12-13 13:12:04,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:04,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:04,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:04,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:04,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:12:04,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:04,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:04,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:12:04,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:04,547 INFO L130 PetriNetUnfolder]: 259/535 cut-off events. [2022-12-13 13:12:04,547 INFO L131 PetriNetUnfolder]: For 3056/3056 co-relation queries the response was YES. [2022-12-13 13:12:04,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 535 events. 259/535 cut-off events. For 3056/3056 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2772 event pairs, 50 based on Foata normal form. 2/537 useless extension candidates. Maximal degree in co-relation 2474. Up to 248 conditions per place. [2022-12-13 13:12:04,551 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 54 selfloop transitions, 21 changer transitions 11/86 dead transitions. [2022-12-13 13:12:04,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 1024 flow [2022-12-13 13:12:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 13:12:04,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2022-12-13 13:12:04,552 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 489 flow. Second operand 5 states and 42 transitions. [2022-12-13 13:12:04,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 1024 flow [2022-12-13 13:12:04,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 968 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:04,558 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 678 flow [2022-12-13 13:12:04,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=678, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2022-12-13 13:12:04,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 39 predicate places. [2022-12-13 13:12:04,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:04,559 INFO L89 Accepts]: Start accepts. Operand has 59 places, 58 transitions, 678 flow [2022-12-13 13:12:04,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:04,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:04,560 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 58 transitions, 678 flow [2022-12-13 13:12:04,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 58 transitions, 678 flow [2022-12-13 13:12:04,574 INFO L130 PetriNetUnfolder]: 42/189 cut-off events. [2022-12-13 13:12:04,575 INFO L131 PetriNetUnfolder]: For 837/845 co-relation queries the response was YES. [2022-12-13 13:12:04,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 189 events. 42/189 cut-off events. For 837/845 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1149 event pairs, 7 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 698. Up to 56 conditions per place. [2022-12-13 13:12:04,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 58 transitions, 678 flow [2022-12-13 13:12:04,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 13:12:04,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [272] $Ultimate##0-->L41-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= (ite (< 1 v_~counter~0_130) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (< 2 v_~N~0_65) (= v_~counter~0_130 (+ v_~counter~0_132 2)) (= v_thread1Thread1of1ForFork0_~i~0_53 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~counter~0=v_~counter~0_132, ~N~0=v_~N~0_65} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~counter~0=v_~counter~0_130, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_27|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_31|, ~N~0=v_~N~0_65, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:04,577 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:04,577 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:04,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] $Ultimate##0-->L51-4: Formula: (and (< 2 v_~N~0_79) (= v_~counter~0_172 v_~counter~0_170) (not (= (ite (< 0 (+ v_~counter~0_172 1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|) (= v_thread1Thread1of1ForFork0_~i~0_73 3) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_80|) (= (ite (< 0 (+ v_~counter~0_170 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|)) InVars {~counter~0=v_~counter~0_172, ~N~0=v_~N~0_79} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48|, ~counter~0=v_~counter~0_170, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_50|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_44|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_73, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_52|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_80|, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:04,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [269] $Ultimate##0-->L41-4: Formula: (and (= 2 v_thread1Thread1of1ForFork0_~i~0_39) (= v_~counter~0_103 (+ v_~counter~0_105 2)) (< v_thread1Thread1of1ForFork0_~i~0_39 (+ 1 v_~N~0_59))) InVars {~counter~0=v_~counter~0_105, ~N~0=v_~N~0_59} OutVars{~counter~0=v_~counter~0_103, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_26|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_20|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [267] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (< 0 v_~counter~0_95) 1 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_33|) (= v_~counter~0_95 (+ v_~counter~0_94 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)) (< 0 v_~N~0_55)) InVars {~counter~0=v_~counter~0_95, ~N~0=v_~N~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_94, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_33|, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:04,783 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:12:04,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 13:12:04,784 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 697 flow [2022-12-13 13:12:04,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:04,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:04,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:04,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:12:04,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:04,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -520871335, now seen corresponding path program 1 times [2022-12-13 13:12:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:04,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179516886] [2022-12-13 13:12:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:04,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:04,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179516886] [2022-12-13 13:12:04,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179516886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:04,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315282207] [2022-12-13 13:12:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:04,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:04,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:04,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:12:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:04,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:04,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:04,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:04,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315282207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:04,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:04,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:12:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776859062] [2022-12-13 13:12:04,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:04,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:12:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:04,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:12:04,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:04,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 13:12:04,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 697 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:04,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:04,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 13:12:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:05,123 INFO L130 PetriNetUnfolder]: 284/588 cut-off events. [2022-12-13 13:12:05,123 INFO L131 PetriNetUnfolder]: For 4940/4940 co-relation queries the response was YES. [2022-12-13 13:12:05,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 588 events. 284/588 cut-off events. For 4940/4940 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3097 event pairs, 93 based on Foata normal form. 60/648 useless extension candidates. Maximal degree in co-relation 2836. Up to 360 conditions per place. [2022-12-13 13:12:05,126 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 71 selfloop transitions, 44 changer transitions 13/128 dead transitions. [2022-12-13 13:12:05,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 128 transitions, 1466 flow [2022-12-13 13:12:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:12:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:12:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2022-12-13 13:12:05,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 13:12:05,128 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 697 flow. Second operand 12 states and 90 transitions. [2022-12-13 13:12:05,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 128 transitions, 1466 flow [2022-12-13 13:12:05,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 128 transitions, 1355 flow, removed 44 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:05,137 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 1002 flow [2022-12-13 13:12:05,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1002, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2022-12-13 13:12:05,137 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 53 predicate places. [2022-12-13 13:12:05,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:05,137 INFO L89 Accepts]: Start accepts. Operand has 73 places, 73 transitions, 1002 flow [2022-12-13 13:12:05,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:05,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:05,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 73 transitions, 1002 flow [2022-12-13 13:12:05,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 1002 flow [2022-12-13 13:12:05,153 INFO L130 PetriNetUnfolder]: 54/217 cut-off events. [2022-12-13 13:12:05,153 INFO L131 PetriNetUnfolder]: For 1573/1583 co-relation queries the response was YES. [2022-12-13 13:12:05,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 217 events. 54/217 cut-off events. For 1573/1583 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1337 event pairs, 8 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 991. Up to 55 conditions per place. [2022-12-13 13:12:05,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 73 transitions, 1002 flow [2022-12-13 13:12:05,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 13:12:05,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:05,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:05,383 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [294] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 1 v_~counter~0_229) 1 0))) (and (= v_~counter~0_229 (+ v_~counter~0_231 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_114|) (not (= .cse0 0)) (= v_thread1Thread1of1ForFork0_~i~0_107 4) (< v_thread1Thread1of1ForFork0_~i~0_107 (+ 1 v_~N~0_97)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|))) InVars {~counter~0=v_~counter~0_231, ~N~0=v_~N~0_97} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, ~counter~0=v_~counter~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_78|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_72|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_107, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_79|, ~N~0=v_~N~0_97, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_114|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:05,383 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:05,383 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:05,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [288] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_192 1))) (and (= v_thread1Thread1of1ForFork0_~i~0_85 3) (not (= (ite (< 0 .cse0) 1 0) 0)) (< 2 v_~N~0_85) (= (ite (< 0 (+ v_~counter~0_192 2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= .cse0 v_~counter~0_190) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|))) InVars {~counter~0=v_~counter~0_192, ~N~0=v_~N~0_85} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, ~counter~0=v_~counter~0_190, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_60|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_85, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_63|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:05,550 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:05,551 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:05,640 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 13:12:05,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 504 [2022-12-13 13:12:05,641 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 1043 flow [2022-12-13 13:12:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:05,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:05,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:05,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:05,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -355008754, now seen corresponding path program 1 times [2022-12-13 13:12:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089729137] [2022-12-13 13:12:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:05,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089729137] [2022-12-13 13:12:05,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089729137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:05,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939898052] [2022-12-13 13:12:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:05,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:05,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:12:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:05,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:05,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:05,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:06,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939898052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:06,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:06,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:12:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348553922] [2022-12-13 13:12:06,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:06,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:12:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:12:06,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:06,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:06,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 1043 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-13 13:12:06,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:06,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:06,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:06,267 INFO L130 PetriNetUnfolder]: 498/1065 cut-off events. [2022-12-13 13:12:06,267 INFO L131 PetriNetUnfolder]: For 12495/12495 co-relation queries the response was YES. [2022-12-13 13:12:06,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 1065 events. 498/1065 cut-off events. For 12495/12495 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6680 event pairs, 105 based on Foata normal form. 60/1123 useless extension candidates. Maximal degree in co-relation 5932. Up to 307 conditions per place. [2022-12-13 13:12:06,275 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 81 selfloop transitions, 91 changer transitions 5/177 dead transitions. [2022-12-13 13:12:06,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 177 transitions, 2576 flow [2022-12-13 13:12:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-12-13 13:12:06,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 13:12:06,276 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 1043 flow. Second operand 9 states and 91 transitions. [2022-12-13 13:12:06,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 177 transitions, 2576 flow [2022-12-13 13:12:06,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 177 transitions, 2119 flow, removed 211 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:06,313 INFO L231 Difference]: Finished difference. Result has 79 places, 127 transitions, 1837 flow [2022-12-13 13:12:06,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1837, PETRI_PLACES=79, PETRI_TRANSITIONS=127} [2022-12-13 13:12:06,314 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 59 predicate places. [2022-12-13 13:12:06,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:06,314 INFO L89 Accepts]: Start accepts. Operand has 79 places, 127 transitions, 1837 flow [2022-12-13 13:12:06,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:06,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:06,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 127 transitions, 1837 flow [2022-12-13 13:12:06,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 127 transitions, 1837 flow [2022-12-13 13:12:06,383 INFO L130 PetriNetUnfolder]: 104/434 cut-off events. [2022-12-13 13:12:06,383 INFO L131 PetriNetUnfolder]: For 3299/3311 co-relation queries the response was YES. [2022-12-13 13:12:06,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 434 events. 104/434 cut-off events. For 3299/3311 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3316 event pairs, 11 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 2151. Up to 124 conditions per place. [2022-12-13 13:12:06,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 127 transitions, 1837 flow [2022-12-13 13:12:06,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-13 13:12:06,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~i~1#1_104| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= v_~counter~0_211 (+ v_~counter~0_213 3)) (= (ite (< 0 (+ v_~counter~0_213 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (< v_thread1Thread1of1ForFork0_~i~0_95 (+ 1 v_~N~0_91)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (= v_thread1Thread1of1ForFork0_~i~0_95 4)) InVars {~counter~0=v_~counter~0_213, ~N~0=v_~N~0_91} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, ~counter~0=v_~counter~0_211, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_69|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_70|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_64|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_95, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_73|, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_104|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:06,387 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:06,387 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:06,479 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:06,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-13 13:12:06,480 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 127 transitions, 1851 flow [2022-12-13 13:12:06,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-13 13:12:06,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:06,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:06,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:06,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:06,685 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -466480503, now seen corresponding path program 1 times [2022-12-13 13:12:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:06,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774242358] [2022-12-13 13:12:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774242358] [2022-12-13 13:12:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774242358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:06,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:06,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:12:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499967482] [2022-12-13 13:12:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:06,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:06,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:06,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:06,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:06,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 127 transitions, 1851 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:06,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:06,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:06,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:06,848 INFO L130 PetriNetUnfolder]: 543/1149 cut-off events. [2022-12-13 13:12:06,848 INFO L131 PetriNetUnfolder]: For 12326/12326 co-relation queries the response was YES. [2022-12-13 13:12:06,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7475 conditions, 1149 events. 543/1149 cut-off events. For 12326/12326 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7419 event pairs, 89 based on Foata normal form. 2/1143 useless extension candidates. Maximal degree in co-relation 7020. Up to 448 conditions per place. [2022-12-13 13:12:06,855 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 100 selfloop transitions, 68 changer transitions 4/172 dead transitions. [2022-12-13 13:12:06,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 172 transitions, 2792 flow [2022-12-13 13:12:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 13:12:06,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2022-12-13 13:12:06,856 INFO L175 Difference]: Start difference. First operand has 78 places, 127 transitions, 1851 flow. Second operand 5 states and 51 transitions. [2022-12-13 13:12:06,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 172 transitions, 2792 flow [2022-12-13 13:12:06,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 172 transitions, 2594 flow, removed 99 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:06,883 INFO L231 Difference]: Finished difference. Result has 84 places, 144 transitions, 2219 flow [2022-12-13 13:12:06,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2219, PETRI_PLACES=84, PETRI_TRANSITIONS=144} [2022-12-13 13:12:06,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 64 predicate places. [2022-12-13 13:12:06,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:06,883 INFO L89 Accepts]: Start accepts. Operand has 84 places, 144 transitions, 2219 flow [2022-12-13 13:12:06,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:06,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:06,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 144 transitions, 2219 flow [2022-12-13 13:12:06,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 144 transitions, 2219 flow [2022-12-13 13:12:06,917 INFO L130 PetriNetUnfolder]: 117/474 cut-off events. [2022-12-13 13:12:06,917 INFO L131 PetriNetUnfolder]: For 4676/4688 co-relation queries the response was YES. [2022-12-13 13:12:06,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 474 events. 117/474 cut-off events. For 4676/4688 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3689 event pairs, 11 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2471. Up to 135 conditions per place. [2022-12-13 13:12:06,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 144 transitions, 2219 flow [2022-12-13 13:12:06,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-13 13:12:06,921 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:06,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 13:12:06,921 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 144 transitions, 2219 flow [2022-12-13 13:12:06,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:06,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:06,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:06,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:12:06,922 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:06,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1374664944, now seen corresponding path program 1 times [2022-12-13 13:12:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:06,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418184768] [2022-12-13 13:12:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:06,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418184768] [2022-12-13 13:12:06,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418184768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:06,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:12:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680115505] [2022-12-13 13:12:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:06,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:06,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 144 transitions, 2219 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:06,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:06,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:06,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:07,120 INFO L130 PetriNetUnfolder]: 532/1125 cut-off events. [2022-12-13 13:12:07,121 INFO L131 PetriNetUnfolder]: For 14186/14186 co-relation queries the response was YES. [2022-12-13 13:12:07,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7602 conditions, 1125 events. 532/1125 cut-off events. For 14186/14186 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7007 event pairs, 91 based on Foata normal form. 3/1120 useless extension candidates. Maximal degree in co-relation 7110. Up to 1062 conditions per place. [2022-12-13 13:12:07,128 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 133 selfloop transitions, 16 changer transitions 10/159 dead transitions. [2022-12-13 13:12:07,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 159 transitions, 2621 flow [2022-12-13 13:12:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 13:12:07,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 13:12:07,129 INFO L175 Difference]: Start difference. First operand has 84 places, 144 transitions, 2219 flow. Second operand 4 states and 49 transitions. [2022-12-13 13:12:07,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 159 transitions, 2621 flow [2022-12-13 13:12:07,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 159 transitions, 2566 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:07,160 INFO L231 Difference]: Finished difference. Result has 88 places, 143 transitions, 2192 flow [2022-12-13 13:12:07,160 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2192, PETRI_PLACES=88, PETRI_TRANSITIONS=143} [2022-12-13 13:12:07,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-13 13:12:07,161 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:07,161 INFO L89 Accepts]: Start accepts. Operand has 88 places, 143 transitions, 2192 flow [2022-12-13 13:12:07,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:07,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:07,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 143 transitions, 2192 flow [2022-12-13 13:12:07,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 143 transitions, 2192 flow [2022-12-13 13:12:07,194 INFO L130 PetriNetUnfolder]: 116/461 cut-off events. [2022-12-13 13:12:07,195 INFO L131 PetriNetUnfolder]: For 4443/4455 co-relation queries the response was YES. [2022-12-13 13:12:07,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 461 events. 116/461 cut-off events. For 4443/4455 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3511 event pairs, 11 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2462. Up to 133 conditions per place. [2022-12-13 13:12:07,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 143 transitions, 2192 flow [2022-12-13 13:12:07,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 13:12:07,199 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:07,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 13:12:07,199 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 143 transitions, 2192 flow [2022-12-13 13:12:07,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:07,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:07,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:07,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:12:07,200 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1489181548, now seen corresponding path program 1 times [2022-12-13 13:12:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:07,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96064875] [2022-12-13 13:12:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:07,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96064875] [2022-12-13 13:12:07,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96064875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:07,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:07,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:12:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239199937] [2022-12-13 13:12:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:07,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:12:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:12:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:12:07,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:07,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 143 transitions, 2192 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:07,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:07,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:07,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:07,402 INFO L130 PetriNetUnfolder]: 548/1148 cut-off events. [2022-12-13 13:12:07,402 INFO L131 PetriNetUnfolder]: For 15615/15615 co-relation queries the response was YES. [2022-12-13 13:12:07,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7848 conditions, 1148 events. 548/1148 cut-off events. For 15615/15615 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7254 event pairs, 208 based on Foata normal form. 20/1162 useless extension candidates. Maximal degree in co-relation 7392. Up to 939 conditions per place. [2022-12-13 13:12:07,410 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 117 selfloop transitions, 44 changer transitions 2/163 dead transitions. [2022-12-13 13:12:07,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 163 transitions, 2733 flow [2022-12-13 13:12:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 13:12:07,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 13:12:07,411 INFO L175 Difference]: Start difference. First operand has 88 places, 143 transitions, 2192 flow. Second operand 4 states and 44 transitions. [2022-12-13 13:12:07,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 163 transitions, 2733 flow [2022-12-13 13:12:07,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 163 transitions, 2719 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:07,434 INFO L231 Difference]: Finished difference. Result has 91 places, 147 transitions, 2377 flow [2022-12-13 13:12:07,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2377, PETRI_PLACES=91, PETRI_TRANSITIONS=147} [2022-12-13 13:12:07,435 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2022-12-13 13:12:07,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:07,435 INFO L89 Accepts]: Start accepts. Operand has 91 places, 147 transitions, 2377 flow [2022-12-13 13:12:07,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:07,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:07,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 147 transitions, 2377 flow [2022-12-13 13:12:07,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 147 transitions, 2377 flow [2022-12-13 13:12:07,469 INFO L130 PetriNetUnfolder]: 121/472 cut-off events. [2022-12-13 13:12:07,469 INFO L131 PetriNetUnfolder]: For 5106/5138 co-relation queries the response was YES. [2022-12-13 13:12:07,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 472 events. 121/472 cut-off events. For 5106/5138 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3585 event pairs, 11 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2593. Up to 137 conditions per place. [2022-12-13 13:12:07,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 147 transitions, 2377 flow [2022-12-13 13:12:07,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-13 13:12:07,474 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:07,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 13:12:07,474 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 147 transitions, 2377 flow [2022-12-13 13:12:07,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:07,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:07,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:07,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:12:07,474 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2136773802, now seen corresponding path program 1 times [2022-12-13 13:12:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:07,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058963127] [2022-12-13 13:12:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:07,507 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-13 13:12:07,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:07,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058963127] [2022-12-13 13:12:07,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058963127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:07,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845254677] [2022-12-13 13:12:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:07,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:07,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:12:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:07,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:07,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:07,578 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-13 13:12:07,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:07,595 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-13 13:12:07,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845254677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:07,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:07,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:12:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968907202] [2022-12-13 13:12:07,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:07,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:12:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:12:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:07,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:07,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 147 transitions, 2377 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:07,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:07,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:07,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:07,833 INFO L130 PetriNetUnfolder]: 553/1155 cut-off events. [2022-12-13 13:12:07,834 INFO L131 PetriNetUnfolder]: For 16461/16461 co-relation queries the response was YES. [2022-12-13 13:12:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8158 conditions, 1155 events. 553/1155 cut-off events. For 16461/16461 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7263 event pairs, 212 based on Foata normal form. 4/1155 useless extension candidates. Maximal degree in co-relation 7689. Up to 955 conditions per place. [2022-12-13 13:12:07,841 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 127 selfloop transitions, 49 changer transitions 5/181 dead transitions. [2022-12-13 13:12:07,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 181 transitions, 2978 flow [2022-12-13 13:12:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:12:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:12:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-13 13:12:07,842 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29910714285714285 [2022-12-13 13:12:07,843 INFO L175 Difference]: Start difference. First operand has 91 places, 147 transitions, 2377 flow. Second operand 8 states and 67 transitions. [2022-12-13 13:12:07,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 181 transitions, 2978 flow [2022-12-13 13:12:07,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 181 transitions, 2914 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:07,868 INFO L231 Difference]: Finished difference. Result has 98 places, 147 transitions, 2426 flow [2022-12-13 13:12:07,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2315, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2426, PETRI_PLACES=98, PETRI_TRANSITIONS=147} [2022-12-13 13:12:07,869 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 78 predicate places. [2022-12-13 13:12:07,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:07,869 INFO L89 Accepts]: Start accepts. Operand has 98 places, 147 transitions, 2426 flow [2022-12-13 13:12:07,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:07,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:07,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 147 transitions, 2426 flow [2022-12-13 13:12:07,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 147 transitions, 2426 flow [2022-12-13 13:12:07,903 INFO L130 PetriNetUnfolder]: 121/476 cut-off events. [2022-12-13 13:12:07,904 INFO L131 PetriNetUnfolder]: For 5529/5561 co-relation queries the response was YES. [2022-12-13 13:12:07,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 476 events. 121/476 cut-off events. For 5529/5561 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3635 event pairs, 11 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2657. Up to 139 conditions per place. [2022-12-13 13:12:07,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 147 transitions, 2426 flow [2022-12-13 13:12:07,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 13:12:07,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:07,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 13:12:07,970 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 147 transitions, 2453 flow [2022-12-13 13:12:07,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:07,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:07,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:07,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:08,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1806711852, now seen corresponding path program 1 times [2022-12-13 13:12:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:08,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754434564] [2022-12-13 13:12:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:08,242 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-13 13:12:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754434564] [2022-12-13 13:12:08,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754434564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226293048] [2022-12-13 13:12:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:08,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:08,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:12:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:08,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:12:08,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:08,312 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-13 13:12:08,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:08,332 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-13 13:12:08,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226293048] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:08,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:08,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2022-12-13 13:12:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822538346] [2022-12-13 13:12:08,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:08,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:12:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:08,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:12:08,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:12:08,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:12:08,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 147 transitions, 2453 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:08,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:08,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:12:08,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:08,584 INFO L130 PetriNetUnfolder]: 706/1453 cut-off events. [2022-12-13 13:12:08,584 INFO L131 PetriNetUnfolder]: For 22405/22405 co-relation queries the response was YES. [2022-12-13 13:12:08,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10581 conditions, 1453 events. 706/1453 cut-off events. For 22405/22405 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9370 event pairs, 99 based on Foata normal form. 5/1452 useless extension candidates. Maximal degree in co-relation 9551. Up to 1143 conditions per place. [2022-12-13 13:12:08,599 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 153 selfloop transitions, 48 changer transitions 8/209 dead transitions. [2022-12-13 13:12:08,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 209 transitions, 3678 flow [2022-12-13 13:12:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 13:12:08,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4413793103448276 [2022-12-13 13:12:08,601 INFO L175 Difference]: Start difference. First operand has 98 places, 147 transitions, 2453 flow. Second operand 5 states and 64 transitions. [2022-12-13 13:12:08,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 209 transitions, 3678 flow [2022-12-13 13:12:08,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 209 transitions, 3576 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:08,639 INFO L231 Difference]: Finished difference. Result has 102 places, 177 transitions, 3095 flow [2022-12-13 13:12:08,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3095, PETRI_PLACES=102, PETRI_TRANSITIONS=177} [2022-12-13 13:12:08,640 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 82 predicate places. [2022-12-13 13:12:08,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:08,640 INFO L89 Accepts]: Start accepts. Operand has 102 places, 177 transitions, 3095 flow [2022-12-13 13:12:08,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:08,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:08,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 177 transitions, 3095 flow [2022-12-13 13:12:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 177 transitions, 3095 flow [2022-12-13 13:12:08,684 INFO L130 PetriNetUnfolder]: 153/586 cut-off events. [2022-12-13 13:12:08,684 INFO L131 PetriNetUnfolder]: For 7322/7362 co-relation queries the response was YES. [2022-12-13 13:12:08,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 586 events. 153/586 cut-off events. For 7322/7362 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4701 event pairs, 15 based on Foata normal form. 3/583 useless extension candidates. Maximal degree in co-relation 3359. Up to 179 conditions per place. [2022-12-13 13:12:08,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 177 transitions, 3095 flow [2022-12-13 13:12:08,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-13 13:12:08,692 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:08,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 13:12:08,692 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 177 transitions, 3095 flow [2022-12-13 13:12:08,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:08,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:08,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:08,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:08,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:08,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -649882558, now seen corresponding path program 1 times [2022-12-13 13:12:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:08,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726031785] [2022-12-13 13:12:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:08,935 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-13 13:12:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726031785] [2022-12-13 13:12:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726031785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809197390] [2022-12-13 13:12:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:08,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:08,937 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:08,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:12:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:08,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:08,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:09,008 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-13 13:12:09,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:09,023 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-13 13:12:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809197390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:09,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:09,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:12:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144417872] [2022-12-13 13:12:09,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:09,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:12:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:12:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:12:09,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:12:09,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 177 transitions, 3095 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:09,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:09,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:12:09,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:09,304 INFO L130 PetriNetUnfolder]: 721/1469 cut-off events. [2022-12-13 13:12:09,305 INFO L131 PetriNetUnfolder]: For 26020/26020 co-relation queries the response was YES. [2022-12-13 13:12:09,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11068 conditions, 1469 events. 721/1469 cut-off events. For 26020/26020 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9501 event pairs, 276 based on Foata normal form. 24/1489 useless extension candidates. Maximal degree in co-relation 9971. Up to 1255 conditions per place. [2022-12-13 13:12:09,313 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 160 selfloop transitions, 46 changer transitions 4/210 dead transitions. [2022-12-13 13:12:09,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 210 transitions, 3842 flow [2022-12-13 13:12:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:12:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:12:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-13 13:12:09,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29064039408866993 [2022-12-13 13:12:09,314 INFO L175 Difference]: Start difference. First operand has 102 places, 177 transitions, 3095 flow. Second operand 7 states and 59 transitions. [2022-12-13 13:12:09,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 210 transitions, 3842 flow [2022-12-13 13:12:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 210 transitions, 3751 flow, removed 40 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:09,353 INFO L231 Difference]: Finished difference. Result has 108 places, 179 transitions, 3164 flow [2022-12-13 13:12:09,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3164, PETRI_PLACES=108, PETRI_TRANSITIONS=179} [2022-12-13 13:12:09,353 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2022-12-13 13:12:09,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:09,353 INFO L89 Accepts]: Start accepts. Operand has 108 places, 179 transitions, 3164 flow [2022-12-13 13:12:09,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:09,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:09,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 179 transitions, 3164 flow [2022-12-13 13:12:09,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 179 transitions, 3164 flow [2022-12-13 13:12:09,399 INFO L130 PetriNetUnfolder]: 157/593 cut-off events. [2022-12-13 13:12:09,399 INFO L131 PetriNetUnfolder]: For 8179/8217 co-relation queries the response was YES. [2022-12-13 13:12:09,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 593 events. 157/593 cut-off events. For 8179/8217 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4741 event pairs, 15 based on Foata normal form. 3/592 useless extension candidates. Maximal degree in co-relation 3564. Up to 180 conditions per place. [2022-12-13 13:12:09,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 179 transitions, 3164 flow [2022-12-13 13:12:09,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 13:12:09,405 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:09,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 13:12:09,406 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 179 transitions, 3164 flow [2022-12-13 13:12:09,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:09,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:09,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:09,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:09,610 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,SelfDestructingSolverStorable20 [2022-12-13 13:12:09,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1483491212, now seen corresponding path program 1 times [2022-12-13 13:12:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:09,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147799916] [2022-12-13 13:12:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:09,658 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-13 13:12:09,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147799916] [2022-12-13 13:12:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147799916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649169309] [2022-12-13 13:12:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:09,660 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:09,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:12:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:09,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:12:09,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:09,724 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-13 13:12:09,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:09,742 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-13 13:12:09,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649169309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:09,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:09,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 13:12:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148025745] [2022-12-13 13:12:09,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:09,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:12:09,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 13:12:09,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 179 transitions, 3164 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:09,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:09,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 13:12:09,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:10,003 INFO L130 PetriNetUnfolder]: 786/1599 cut-off events. [2022-12-13 13:12:10,003 INFO L131 PetriNetUnfolder]: For 28796/28796 co-relation queries the response was YES. [2022-12-13 13:12:10,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12290 conditions, 1599 events. 786/1599 cut-off events. For 28796/28796 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10405 event pairs, 115 based on Foata normal form. 5/1604 useless extension candidates. Maximal degree in co-relation 11803. Up to 1459 conditions per place. [2022-12-13 13:12:10,015 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 185 selfloop transitions, 28 changer transitions 6/219 dead transitions. [2022-12-13 13:12:10,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 219 transitions, 4166 flow [2022-12-13 13:12:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 13:12:10,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 13:12:10,017 INFO L175 Difference]: Start difference. First operand has 106 places, 179 transitions, 3164 flow. Second operand 5 states and 57 transitions. [2022-12-13 13:12:10,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 219 transitions, 4166 flow [2022-12-13 13:12:10,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 3941 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-13 13:12:10,064 INFO L231 Difference]: Finished difference. Result has 108 places, 195 transitions, 3432 flow [2022-12-13 13:12:10,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3432, PETRI_PLACES=108, PETRI_TRANSITIONS=195} [2022-12-13 13:12:10,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2022-12-13 13:12:10,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:10,065 INFO L89 Accepts]: Start accepts. Operand has 108 places, 195 transitions, 3432 flow [2022-12-13 13:12:10,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:10,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:10,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 195 transitions, 3432 flow [2022-12-13 13:12:10,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 195 transitions, 3432 flow [2022-12-13 13:12:10,121 INFO L130 PetriNetUnfolder]: 172/645 cut-off events. [2022-12-13 13:12:10,121 INFO L131 PetriNetUnfolder]: For 8952/8990 co-relation queries the response was YES. [2022-12-13 13:12:10,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 645 events. 172/645 cut-off events. For 8952/8990 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5185 event pairs, 16 based on Foata normal form. 3/644 useless extension candidates. Maximal degree in co-relation 3970. Up to 197 conditions per place. [2022-12-13 13:12:10,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 195 transitions, 3432 flow [2022-12-13 13:12:10,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-13 13:12:10,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= (ite (< 0 (+ v_~counter~0_267 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= v_~counter~0_265 (+ v_~counter~0_267 4)) (= |v_thread2Thread1of1ForFork1_~i~1#1_136| 1) (= 5 v_thread1Thread1of1ForFork0_~i~0_125) (< v_thread1Thread1of1ForFork0_~i~0_125 (+ v_~N~0_107 1))) InVars {~counter~0=v_~counter~0_267, ~N~0=v_~N~0_107} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95|, ~counter~0=v_~counter~0_265, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_96|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_90|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_99|, ~N~0=v_~N~0_107, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_136|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:10,128 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:10,128 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:10,210 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:10,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 13:12:10,210 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 195 transitions, 3451 flow [2022-12-13 13:12:10,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:10,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:10,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:10,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:10,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 13:12:10,415 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1972382543, now seen corresponding path program 1 times [2022-12-13 13:12:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:10,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681377362] [2022-12-13 13:12:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681377362] [2022-12-13 13:12:10,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681377362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173772033] [2022-12-13 13:12:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:10,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:10,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:12:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:10,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:10,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:10,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:10,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173772033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:10,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:10,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 13:12:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940042800] [2022-12-13 13:12:10,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:10,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:10,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 195 transitions, 3451 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:10,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:10,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:10,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:10,888 INFO L130 PetriNetUnfolder]: 827/1627 cut-off events. [2022-12-13 13:12:10,888 INFO L131 PetriNetUnfolder]: For 30281/30281 co-relation queries the response was YES. [2022-12-13 13:12:10,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12797 conditions, 1627 events. 827/1627 cut-off events. For 30281/30281 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10331 event pairs, 63 based on Foata normal form. 20/1647 useless extension candidates. Maximal degree in co-relation 12308. Up to 557 conditions per place. [2022-12-13 13:12:10,899 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 99 selfloop transitions, 188 changer transitions 11/298 dead transitions. [2022-12-13 13:12:10,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 298 transitions, 5384 flow [2022-12-13 13:12:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:12:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:12:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-12-13 13:12:10,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24489795918367346 [2022-12-13 13:12:10,900 INFO L175 Difference]: Start difference. First operand has 108 places, 195 transitions, 3451 flow. Second operand 14 states and 96 transitions. [2022-12-13 13:12:10,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 298 transitions, 5384 flow [2022-12-13 13:12:10,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 298 transitions, 5139 flow, removed 100 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:10,954 INFO L231 Difference]: Finished difference. Result has 125 places, 240 transitions, 4702 flow [2022-12-13 13:12:10,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3254, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4702, PETRI_PLACES=125, PETRI_TRANSITIONS=240} [2022-12-13 13:12:10,955 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2022-12-13 13:12:10,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:10,955 INFO L89 Accepts]: Start accepts. Operand has 125 places, 240 transitions, 4702 flow [2022-12-13 13:12:10,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:10,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:10,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 240 transitions, 4702 flow [2022-12-13 13:12:10,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 240 transitions, 4702 flow [2022-12-13 13:12:11,012 INFO L130 PetriNetUnfolder]: 178/626 cut-off events. [2022-12-13 13:12:11,013 INFO L131 PetriNetUnfolder]: For 12434/12446 co-relation queries the response was YES. [2022-12-13 13:12:11,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 626 events. 178/626 cut-off events. For 12434/12446 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4950 event pairs, 8 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 4503. Up to 194 conditions per place. [2022-12-13 13:12:11,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 240 transitions, 4702 flow [2022-12-13 13:12:11,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 798 [2022-12-13 13:12:11,020 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:11,020 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 13:12:11,020 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 4702 flow [2022-12-13 13:12:11,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:11,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:11,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:11,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:11,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 13:12:11,225 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1430005387, now seen corresponding path program 1 times [2022-12-13 13:12:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:11,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641809655] [2022-12-13 13:12:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:11,283 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-13 13:12:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:11,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641809655] [2022-12-13 13:12:11,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641809655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:11,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137641521] [2022-12-13 13:12:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:11,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:11,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:11,285 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:11,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:12:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:11,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:11,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:11,356 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-13 13:12:11,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:11,374 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-13 13:12:11,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137641521] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:11,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:11,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:12:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116886342] [2022-12-13 13:12:11,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:11,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:12:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:12:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:11,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:12:11,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 4702 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:11,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:11,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:12:11,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:11,706 INFO L130 PetriNetUnfolder]: 809/1586 cut-off events. [2022-12-13 13:12:11,706 INFO L131 PetriNetUnfolder]: For 42021/42021 co-relation queries the response was YES. [2022-12-13 13:12:11,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13874 conditions, 1586 events. 809/1586 cut-off events. For 42021/42021 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9876 event pairs, 259 based on Foata normal form. 4/1590 useless extension candidates. Maximal degree in co-relation 13311. Up to 1359 conditions per place. [2022-12-13 13:12:11,716 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 216 selfloop transitions, 59 changer transitions 0/275 dead transitions. [2022-12-13 13:12:11,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 275 transitions, 5583 flow [2022-12-13 13:12:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-12-13 13:12:11,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 13:12:11,718 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 4702 flow. Second operand 9 states and 66 transitions. [2022-12-13 13:12:11,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 275 transitions, 5583 flow [2022-12-13 13:12:11,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 275 transitions, 5309 flow, removed 130 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:11,821 INFO L231 Difference]: Finished difference. Result has 133 places, 242 transitions, 4623 flow [2022-12-13 13:12:11,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4443, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4623, PETRI_PLACES=133, PETRI_TRANSITIONS=242} [2022-12-13 13:12:11,822 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 113 predicate places. [2022-12-13 13:12:11,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:11,822 INFO L89 Accepts]: Start accepts. Operand has 133 places, 242 transitions, 4623 flow [2022-12-13 13:12:11,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:11,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:11,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 242 transitions, 4623 flow [2022-12-13 13:12:11,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 242 transitions, 4623 flow [2022-12-13 13:12:11,879 INFO L130 PetriNetUnfolder]: 178/641 cut-off events. [2022-12-13 13:12:11,879 INFO L131 PetriNetUnfolder]: For 12791/12827 co-relation queries the response was YES. [2022-12-13 13:12:11,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4551 conditions, 641 events. 178/641 cut-off events. For 12791/12827 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5103 event pairs, 8 based on Foata normal form. 3/641 useless extension candidates. Maximal degree in co-relation 4328. Up to 177 conditions per place. [2022-12-13 13:12:11,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 242 transitions, 4623 flow [2022-12-13 13:12:11,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 806 [2022-12-13 13:12:11,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:12,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_135 (+ v_~N~0_109 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= 5 v_thread1Thread1of1ForFork0_~i~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (< 0 (+ v_~counter~0_288 4)) 1 0)) (= v_~counter~0_286 (+ v_~counter~0_288 3)) (not (= (ite (< 0 (+ v_~counter~0_288 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_288, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_286, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_111|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [305] L41-4-->L51-4: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_142 1) v_thread1Thread1of1ForFork0_~i~0_141) (= v_~counter~0_300 v_~counter~0_298) (< |v_thread2Thread1of1ForFork1_~i~1#1_161| v_~N~0_111) (= |v_thread2Thread1of1ForFork1_~i~1#1_160| (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 1)) (< v_thread1Thread1of1ForFork0_~i~0_142 v_~N~0_111) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| (ite (< 0 (+ v_~counter~0_298 1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115| 0))) InVars {~counter~0=v_~counter~0_300, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_142, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~N~0=v_~N~0_111} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|, ~counter~0=v_~counter~0_298, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_112|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_106|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_119|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_160|, ~N~0=v_~N~0_111} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:12,104 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:12,104 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:12,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_135 (+ v_~N~0_109 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= 5 v_thread1Thread1of1ForFork0_~i~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (< 0 (+ v_~counter~0_288 4)) 1 0)) (= v_~counter~0_286 (+ v_~counter~0_288 3)) (not (= (ite (< 0 (+ v_~counter~0_288 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_288, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_286, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_111|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [306] L41-4-->L51-4: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_37| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (< v_thread1Thread1of1ForFork0_~i~0_146 v_~N~0_113) (not (< v_thread1Thread1of1ForFork0_~i~0_145 v_~N~0_113)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_165|) |v_thread2Thread1of1ForFork1_~i~1#1_164|) (< |v_thread2Thread1of1ForFork1_~i~1#1_164| (+ v_~N~0_113 1)) (= |v_thread1Thread1of1ForFork0_#res.base_37| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|) (= (+ v_thread1Thread1of1ForFork0_~i~0_146 1) v_thread1Thread1of1ForFork0_~i~0_145) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| (ite (< 0 (+ v_~counter~0_304 1)) 1 0)) (= v_~counter~0_306 (+ v_~counter~0_304 2))) InVars {~counter~0=v_~counter~0_306, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_146, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_165|, ~N~0=v_~N~0_113} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, ~counter~0=v_~counter~0_304, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_37|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_114|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_108|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_145, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_37|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_164|, ~N~0=v_~N~0_113} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:12,217 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:12,217 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:12,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_135 (+ v_~N~0_109 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= 5 v_thread1Thread1of1ForFork0_~i~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (< 0 (+ v_~counter~0_288 4)) 1 0)) (= v_~counter~0_286 (+ v_~counter~0_288 3)) (not (= (ite (< 0 (+ v_~counter~0_288 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_288, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_286, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_111|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:12,446 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:12,446 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:12,552 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:12:12,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 730 [2022-12-13 13:12:12,552 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 242 transitions, 4744 flow [2022-12-13 13:12:12,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:12,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:12,553 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:12,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:12,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 13:12:12,757 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -67732169, now seen corresponding path program 1 times [2022-12-13 13:12:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:12,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555961675] [2022-12-13 13:12:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:12,809 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-13 13:12:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:12,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555961675] [2022-12-13 13:12:12,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555961675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:12,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676185008] [2022-12-13 13:12:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:12,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:12,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:12,811 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:12,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 13:12:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:12,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:12:12,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:12,878 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-13 13:12:12,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:12,896 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-13 13:12:12,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676185008] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:12,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:12,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2022-12-13 13:12:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379365570] [2022-12-13 13:12:12,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:12,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:12:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:12:12,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:12:12,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:12:12,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 242 transitions, 4744 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:12,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:12,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:12:12,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:13,219 INFO L130 PetriNetUnfolder]: 898/1773 cut-off events. [2022-12-13 13:12:13,220 INFO L131 PetriNetUnfolder]: For 51901/51901 co-relation queries the response was YES. [2022-12-13 13:12:13,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15546 conditions, 1773 events. 898/1773 cut-off events. For 51901/51901 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11540 event pairs, 117 based on Foata normal form. 12/1785 useless extension candidates. Maximal degree in co-relation 14987. Up to 1108 conditions per place. [2022-12-13 13:12:13,232 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 202 selfloop transitions, 82 changer transitions 25/309 dead transitions. [2022-12-13 13:12:13,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 309 transitions, 6399 flow [2022-12-13 13:12:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 13:12:13,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-13 13:12:13,233 INFO L175 Difference]: Start difference. First operand has 133 places, 242 transitions, 4744 flow. Second operand 5 states and 64 transitions. [2022-12-13 13:12:13,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 309 transitions, 6399 flow [2022-12-13 13:12:13,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 309 transitions, 6226 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-12-13 13:12:13,358 INFO L231 Difference]: Finished difference. Result has 136 places, 252 transitions, 5124 flow [2022-12-13 13:12:13,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4600, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5124, PETRI_PLACES=136, PETRI_TRANSITIONS=252} [2022-12-13 13:12:13,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 116 predicate places. [2022-12-13 13:12:13,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:13,359 INFO L89 Accepts]: Start accepts. Operand has 136 places, 252 transitions, 5124 flow [2022-12-13 13:12:13,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:13,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:13,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 252 transitions, 5124 flow [2022-12-13 13:12:13,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 252 transitions, 5124 flow [2022-12-13 13:12:13,421 INFO L130 PetriNetUnfolder]: 191/691 cut-off events. [2022-12-13 13:12:13,421 INFO L131 PetriNetUnfolder]: For 14994/15036 co-relation queries the response was YES. [2022-12-13 13:12:13,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 691 events. 191/691 cut-off events. For 14994/15036 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5687 event pairs, 12 based on Foata normal form. 3/690 useless extension candidates. Maximal degree in co-relation 5014. Up to 203 conditions per place. [2022-12-13 13:12:13,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 252 transitions, 5124 flow [2022-12-13 13:12:13,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 13:12:13,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:13,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 13:12:13,431 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 252 transitions, 5124 flow [2022-12-13 13:12:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:13,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:13,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:13,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:13,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:13,635 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1764549366, now seen corresponding path program 1 times [2022-12-13 13:12:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:13,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462272493] [2022-12-13 13:12:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:13,660 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-13 13:12:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462272493] [2022-12-13 13:12:13,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462272493] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44344746] [2022-12-13 13:12:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:13,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:13,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:13,661 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:13,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:12:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:13,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:13,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:13,742 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-13 13:12:13,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:13,759 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-13 13:12:13,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44344746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:13,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:13,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 13:12:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344304990] [2022-12-13 13:12:13,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:13,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:12:13,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 252 transitions, 5124 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:13,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:13,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:12:13,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:14,116 INFO L130 PetriNetUnfolder]: 1017/2004 cut-off events. [2022-12-13 13:12:14,116 INFO L131 PetriNetUnfolder]: For 67520/67520 co-relation queries the response was YES. [2022-12-13 13:12:14,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17802 conditions, 2004 events. 1017/2004 cut-off events. For 67520/67520 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13217 event pairs, 281 based on Foata normal form. 88/2092 useless extension candidates. Maximal degree in co-relation 17235. Up to 1357 conditions per place. [2022-12-13 13:12:14,130 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 208 selfloop transitions, 127 changer transitions 3/338 dead transitions. [2022-12-13 13:12:14,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 338 transitions, 7264 flow [2022-12-13 13:12:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:12:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:12:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-13 13:12:14,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29493087557603687 [2022-12-13 13:12:14,131 INFO L175 Difference]: Start difference. First operand has 135 places, 252 transitions, 5124 flow. Second operand 7 states and 64 transitions. [2022-12-13 13:12:14,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 338 transitions, 7264 flow [2022-12-13 13:12:14,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 338 transitions, 7141 flow, removed 37 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:14,277 INFO L231 Difference]: Finished difference. Result has 141 places, 284 transitions, 6230 flow [2022-12-13 13:12:14,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=5029, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6230, PETRI_PLACES=141, PETRI_TRANSITIONS=284} [2022-12-13 13:12:14,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 121 predicate places. [2022-12-13 13:12:14,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:14,278 INFO L89 Accepts]: Start accepts. Operand has 141 places, 284 transitions, 6230 flow [2022-12-13 13:12:14,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:14,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:14,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 284 transitions, 6230 flow [2022-12-13 13:12:14,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 284 transitions, 6230 flow [2022-12-13 13:12:14,351 INFO L130 PetriNetUnfolder]: 219/787 cut-off events. [2022-12-13 13:12:14,352 INFO L131 PetriNetUnfolder]: For 18744/18786 co-relation queries the response was YES. [2022-12-13 13:12:14,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 787 events. 219/787 cut-off events. For 18744/18786 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6593 event pairs, 13 based on Foata normal form. 3/785 useless extension candidates. Maximal degree in co-relation 5958. Up to 225 conditions per place. [2022-12-13 13:12:14,359 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 284 transitions, 6230 flow [2022-12-13 13:12:14,359 INFO L226 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-13 13:12:14,360 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:14,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 13:12:14,361 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 284 transitions, 6230 flow [2022-12-13 13:12:14,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:14,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:14,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:14,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:14,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 13:12:14,565 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 989679529, now seen corresponding path program 1 times [2022-12-13 13:12:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:14,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930845924] [2022-12-13 13:12:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:14,594 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-13 13:12:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:14,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930845924] [2022-12-13 13:12:14,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930845924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:14,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258462138] [2022-12-13 13:12:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:14,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:14,596 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:14,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:12:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:14,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:14,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:14,684 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-13 13:12:14,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:14,700 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-13 13:12:14,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258462138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:14,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:14,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:12:14,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765086440] [2022-12-13 13:12:14,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:14,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:12:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:14,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:12:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:12:14,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:12:14,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 284 transitions, 6230 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:14,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:14,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:12:14,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:15,051 INFO L130 PetriNetUnfolder]: 1016/2007 cut-off events. [2022-12-13 13:12:15,051 INFO L131 PetriNetUnfolder]: For 64879/64879 co-relation queries the response was YES. [2022-12-13 13:12:15,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18588 conditions, 2007 events. 1016/2007 cut-off events. For 64879/64879 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13301 event pairs, 355 based on Foata normal form. 4/2011 useless extension candidates. Maximal degree in co-relation 18008. Up to 1717 conditions per place. [2022-12-13 13:12:15,065 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 252 selfloop transitions, 69 changer transitions 1/322 dead transitions. [2022-12-13 13:12:15,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 322 transitions, 7308 flow [2022-12-13 13:12:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:12:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:12:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-13 13:12:15,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28110599078341014 [2022-12-13 13:12:15,068 INFO L175 Difference]: Start difference. First operand has 141 places, 284 transitions, 6230 flow. Second operand 7 states and 61 transitions. [2022-12-13 13:12:15,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 322 transitions, 7308 flow [2022-12-13 13:12:15,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 322 transitions, 7125 flow, removed 78 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:15,232 INFO L231 Difference]: Finished difference. Result has 146 places, 286 transitions, 6265 flow [2022-12-13 13:12:15,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6047, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6265, PETRI_PLACES=146, PETRI_TRANSITIONS=286} [2022-12-13 13:12:15,233 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 126 predicate places. [2022-12-13 13:12:15,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:15,233 INFO L89 Accepts]: Start accepts. Operand has 146 places, 286 transitions, 6265 flow [2022-12-13 13:12:15,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:15,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:15,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 286 transitions, 6265 flow [2022-12-13 13:12:15,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 286 transitions, 6265 flow [2022-12-13 13:12:15,313 INFO L130 PetriNetUnfolder]: 219/791 cut-off events. [2022-12-13 13:12:15,313 INFO L131 PetriNetUnfolder]: For 19718/19760 co-relation queries the response was YES. [2022-12-13 13:12:15,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6245 conditions, 791 events. 219/791 cut-off events. For 19718/19760 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6607 event pairs, 13 based on Foata normal form. 3/790 useless extension candidates. Maximal degree in co-relation 6008. Up to 227 conditions per place. [2022-12-13 13:12:15,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 286 transitions, 6265 flow [2022-12-13 13:12:15,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-13 13:12:15,323 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:15,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 13:12:15,324 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 286 transitions, 6265 flow [2022-12-13 13:12:15,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:15,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:15,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:15,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 13:12:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 13:12:15,529 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash -396973318, now seen corresponding path program 1 times [2022-12-13 13:12:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:15,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016074627] [2022-12-13 13:12:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:15,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:15,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016074627] [2022-12-13 13:12:15,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016074627] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:15,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920480524] [2022-12-13 13:12:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:15,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:15,575 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:15,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:12:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:15,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:15,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:15,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:15,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920480524] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:15,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:15,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 13:12:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705628466] [2022-12-13 13:12:15,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:15,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:12:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:12:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:12:15,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:12:15,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 286 transitions, 6265 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 13:12:15,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:15,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:12:15,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:16,136 INFO L130 PetriNetUnfolder]: 1108/2175 cut-off events. [2022-12-13 13:12:16,137 INFO L131 PetriNetUnfolder]: For 71196/71196 co-relation queries the response was YES. [2022-12-13 13:12:16,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20367 conditions, 2175 events. 1108/2175 cut-off events. For 71196/71196 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14537 event pairs, 297 based on Foata normal form. 4/2179 useless extension candidates. Maximal degree in co-relation 19780. Up to 1523 conditions per place. [2022-12-13 13:12:16,152 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 230 selfloop transitions, 141 changer transitions 1/372 dead transitions. [2022-12-13 13:12:16,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 372 transitions, 8362 flow [2022-12-13 13:12:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-13 13:12:16,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23460410557184752 [2022-12-13 13:12:16,165 INFO L175 Difference]: Start difference. First operand has 146 places, 286 transitions, 6265 flow. Second operand 11 states and 80 transitions. [2022-12-13 13:12:16,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 372 transitions, 8362 flow [2022-12-13 13:12:16,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 372 transitions, 8278 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:16,331 INFO L231 Difference]: Finished difference. Result has 156 places, 311 transitions, 7181 flow [2022-12-13 13:12:16,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6189, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7181, PETRI_PLACES=156, PETRI_TRANSITIONS=311} [2022-12-13 13:12:16,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2022-12-13 13:12:16,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:16,332 INFO L89 Accepts]: Start accepts. Operand has 156 places, 311 transitions, 7181 flow [2022-12-13 13:12:16,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:16,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:16,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 311 transitions, 7181 flow [2022-12-13 13:12:16,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 311 transitions, 7181 flow [2022-12-13 13:12:16,422 INFO L130 PetriNetUnfolder]: 239/847 cut-off events. [2022-12-13 13:12:16,422 INFO L131 PetriNetUnfolder]: For 23046/23084 co-relation queries the response was YES. [2022-12-13 13:12:16,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7003 conditions, 847 events. 239/847 cut-off events. For 23046/23084 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7165 event pairs, 12 based on Foata normal form. 3/847 useless extension candidates. Maximal degree in co-relation 6761. Up to 263 conditions per place. [2022-12-13 13:12:16,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 311 transitions, 7181 flow [2022-12-13 13:12:16,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 13:12:16,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [307] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| (ite (< 0 (+ v_~counter~0_312 1)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (= v_~counter~0_310 (+ v_~counter~0_312 5)) (= 6 v_thread1Thread1of1ForFork0_~i~0_149) (= |v_thread2Thread1of1ForFork1_~i~1#1_168| 1) (< 5 v_~N~0_115)) InVars {~counter~0=v_~counter~0_312, ~N~0=v_~N~0_115} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, ~counter~0=v_~counter~0_310, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_116|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_110|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_149, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_123|, ~N~0=v_~N~0_115, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_168|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:16,501 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:16,501 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:16,651 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:12:16,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-13 13:12:16,652 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 310 transitions, 7219 flow [2022-12-13 13:12:16,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 13:12:16,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:16,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:16,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:16,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 13:12:16,857 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash -399911017, now seen corresponding path program 1 times [2022-12-13 13:12:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:16,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193713508] [2022-12-13 13:12:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:16,907 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-13 13:12:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193713508] [2022-12-13 13:12:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193713508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609642952] [2022-12-13 13:12:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:16,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:16,908 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:16,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:12:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:16,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:12:16,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:16,983 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-13 13:12:16,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:17,004 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-13 13:12:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609642952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:17,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:17,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2022-12-13 13:12:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325798901] [2022-12-13 13:12:17,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:17,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:12:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:12:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:12:17,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:12:17,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 310 transitions, 7219 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:17,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:17,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:12:17,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:17,422 INFO L130 PetriNetUnfolder]: 1112/2190 cut-off events. [2022-12-13 13:12:17,422 INFO L131 PetriNetUnfolder]: For 77048/77048 co-relation queries the response was YES. [2022-12-13 13:12:17,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21124 conditions, 2190 events. 1112/2190 cut-off events. For 77048/77048 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14726 event pairs, 163 based on Foata normal form. 5/2195 useless extension candidates. Maximal degree in co-relation 20530. Up to 2002 conditions per place. [2022-12-13 13:12:17,436 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 278 selfloop transitions, 40 changer transitions 19/337 dead transitions. [2022-12-13 13:12:17,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 337 transitions, 8195 flow [2022-12-13 13:12:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 13:12:17,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2022-12-13 13:12:17,437 INFO L175 Difference]: Start difference. First operand has 155 places, 310 transitions, 7219 flow. Second operand 5 states and 57 transitions. [2022-12-13 13:12:17,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 337 transitions, 8195 flow [2022-12-13 13:12:17,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 337 transitions, 8075 flow, removed 55 selfloop flow, removed 4 redundant places. [2022-12-13 13:12:17,625 INFO L231 Difference]: Finished difference. Result has 158 places, 310 transitions, 7225 flow [2022-12-13 13:12:17,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7099, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7225, PETRI_PLACES=158, PETRI_TRANSITIONS=310} [2022-12-13 13:12:17,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2022-12-13 13:12:17,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:17,626 INFO L89 Accepts]: Start accepts. Operand has 158 places, 310 transitions, 7225 flow [2022-12-13 13:12:17,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:17,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:17,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 310 transitions, 7225 flow [2022-12-13 13:12:17,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 310 transitions, 7225 flow [2022-12-13 13:12:17,715 INFO L130 PetriNetUnfolder]: 238/845 cut-off events. [2022-12-13 13:12:17,715 INFO L131 PetriNetUnfolder]: For 23057/23103 co-relation queries the response was YES. [2022-12-13 13:12:17,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7060 conditions, 845 events. 238/845 cut-off events. For 23057/23103 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7143 event pairs, 12 based on Foata normal form. 3/844 useless extension candidates. Maximal degree in co-relation 6813. Up to 261 conditions per place. [2022-12-13 13:12:17,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 310 transitions, 7225 flow [2022-12-13 13:12:17,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-13 13:12:17,725 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:17,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 13:12:17,726 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 310 transitions, 7225 flow [2022-12-13 13:12:17,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:17,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:17,726 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:17,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:17,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 13:12:17,927 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1077767495, now seen corresponding path program 1 times [2022-12-13 13:12:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:17,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141254869] [2022-12-13 13:12:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:17,955 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-13 13:12:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:17,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141254869] [2022-12-13 13:12:17,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141254869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:17,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080159004] [2022-12-13 13:12:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:17,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:17,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:17,957 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:17,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 13:12:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:18,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:18,044 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-13 13:12:18,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:18,057 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-13 13:12:18,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080159004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:18,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:18,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:12:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521274825] [2022-12-13 13:12:18,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:18,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:12:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:12:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:12:18,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:12:18,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 310 transitions, 7225 flow. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-13 13:12:18,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:18,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:12:18,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:18,493 INFO L130 PetriNetUnfolder]: 1168/2289 cut-off events. [2022-12-13 13:12:18,493 INFO L131 PetriNetUnfolder]: For 90098/90098 co-relation queries the response was YES. [2022-12-13 13:12:18,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22209 conditions, 2289 events. 1168/2289 cut-off events. For 90098/90098 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15481 event pairs, 282 based on Foata normal form. 40/2329 useless extension candidates. Maximal degree in co-relation 21608. Up to 1384 conditions per place. [2022-12-13 13:12:18,509 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 218 selfloop transitions, 167 changer transitions 2/387 dead transitions. [2022-12-13 13:12:18,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 387 transitions, 9202 flow [2022-12-13 13:12:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-12-13 13:12:18,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25252525252525254 [2022-12-13 13:12:18,510 INFO L175 Difference]: Start difference. First operand has 158 places, 310 transitions, 7225 flow. Second operand 9 states and 75 transitions. [2022-12-13 13:12:18,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 387 transitions, 9202 flow [2022-12-13 13:12:18,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 387 transitions, 9144 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:18,707 INFO L231 Difference]: Finished difference. Result has 166 places, 326 transitions, 8154 flow [2022-12-13 13:12:18,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7169, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8154, PETRI_PLACES=166, PETRI_TRANSITIONS=326} [2022-12-13 13:12:18,708 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 146 predicate places. [2022-12-13 13:12:18,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:18,708 INFO L89 Accepts]: Start accepts. Operand has 166 places, 326 transitions, 8154 flow [2022-12-13 13:12:18,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:18,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:18,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 326 transitions, 8154 flow [2022-12-13 13:12:18,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 326 transitions, 8154 flow [2022-12-13 13:12:18,801 INFO L130 PetriNetUnfolder]: 250/888 cut-off events. [2022-12-13 13:12:18,802 INFO L131 PetriNetUnfolder]: For 27721/27767 co-relation queries the response was YES. [2022-12-13 13:12:18,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7781 conditions, 888 events. 250/888 cut-off events. For 27721/27767 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7622 event pairs, 12 based on Foata normal form. 3/887 useless extension candidates. Maximal degree in co-relation 7531. Up to 282 conditions per place. [2022-12-13 13:12:18,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 326 transitions, 8154 flow [2022-12-13 13:12:18,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-13 13:12:18,812 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:18,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 13:12:18,813 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 326 transitions, 8154 flow [2022-12-13 13:12:18,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-13 13:12:18,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:18,813 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:18,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:19,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:19,017 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -841319884, now seen corresponding path program 1 times [2022-12-13 13:12:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:19,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193180854] [2022-12-13 13:12:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:19,085 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-13 13:12:19,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:19,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193180854] [2022-12-13 13:12:19,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193180854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:19,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468820362] [2022-12-13 13:12:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:19,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:19,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:19,087 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:19,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 13:12:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:19,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:12:19,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:19,175 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-13 13:12:19,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:19,200 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-13 13:12:19,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468820362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:19,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:19,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 13:12:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453983901] [2022-12-13 13:12:19,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:19,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:12:19,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 326 transitions, 8154 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:19,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:19,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:12:19,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:19,637 INFO L130 PetriNetUnfolder]: 1181/2321 cut-off events. [2022-12-13 13:12:19,637 INFO L131 PetriNetUnfolder]: For 93871/93871 co-relation queries the response was YES. [2022-12-13 13:12:19,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23632 conditions, 2321 events. 1181/2321 cut-off events. For 93871/93871 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15800 event pairs, 145 based on Foata normal form. 5/2326 useless extension candidates. Maximal degree in co-relation 23022. Up to 1621 conditions per place. [2022-12-13 13:12:19,654 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 274 selfloop transitions, 89 changer transitions 23/386 dead transitions. [2022-12-13 13:12:19,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 386 transitions, 9835 flow [2022-12-13 13:12:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 13:12:19,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35858585858585856 [2022-12-13 13:12:19,656 INFO L175 Difference]: Start difference. First operand has 166 places, 326 transitions, 8154 flow. Second operand 6 states and 71 transitions. [2022-12-13 13:12:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 386 transitions, 9835 flow [2022-12-13 13:12:19,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 386 transitions, 9679 flow, removed 62 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:19,924 INFO L231 Difference]: Finished difference. Result has 172 places, 328 transitions, 8418 flow [2022-12-13 13:12:19,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7998, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8418, PETRI_PLACES=172, PETRI_TRANSITIONS=328} [2022-12-13 13:12:19,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 152 predicate places. [2022-12-13 13:12:19,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:19,924 INFO L89 Accepts]: Start accepts. Operand has 172 places, 328 transitions, 8418 flow [2022-12-13 13:12:19,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:19,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:19,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 328 transitions, 8418 flow [2022-12-13 13:12:19,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 328 transitions, 8418 flow [2022-12-13 13:12:20,022 INFO L130 PetriNetUnfolder]: 251/890 cut-off events. [2022-12-13 13:12:20,022 INFO L131 PetriNetUnfolder]: For 28611/28663 co-relation queries the response was YES. [2022-12-13 13:12:20,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 890 events. 251/890 cut-off events. For 28611/28663 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7636 event pairs, 12 based on Foata normal form. 3/889 useless extension candidates. Maximal degree in co-relation 7774. Up to 284 conditions per place. [2022-12-13 13:12:20,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 328 transitions, 8418 flow [2022-12-13 13:12:20,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 13:12:20,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [315] $Ultimate##0-->L41-4: Formula: (and (= (ite (< 0 (+ v_~counter~0_357 4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_201|) (= 7 v_thread1Thread1of1ForFork0_~i~0_173) (< v_thread1Thread1of1ForFork0_~i~0_173 (+ v_~N~0_125 1)) (= v_~counter~0_355 (+ v_~counter~0_357 5)) (not (= (ite (< 0 (+ v_~counter~0_357 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_357, ~N~0=v_~N~0_125} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|, ~counter~0=v_~counter~0_355, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_140|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_134|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_173, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_151|, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_201|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:20,033 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:20,033 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:20,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:20,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 13:12:20,123 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 328 transitions, 8436 flow [2022-12-13 13:12:20,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:20,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:20,123 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:20,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:20,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 13:12:20,327 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:20,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash 266811810, now seen corresponding path program 1 times [2022-12-13 13:12:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:20,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608488254] [2022-12-13 13:12:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:20,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:20,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608488254] [2022-12-13 13:12:20,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608488254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:20,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845436476] [2022-12-13 13:12:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:20,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:20,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:20,369 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:20,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 13:12:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:20,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:20,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:20,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:20,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845436476] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:20,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:20,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 13:12:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382072473] [2022-12-13 13:12:20,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:20,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:12:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:12:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:12:20,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 13:12:20,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 328 transitions, 8436 flow. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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-13 13:12:20,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:20,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 13:12:20,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:21,318 INFO L130 PetriNetUnfolder]: 1676/3237 cut-off events. [2022-12-13 13:12:21,318 INFO L131 PetriNetUnfolder]: For 140524/140524 co-relation queries the response was YES. [2022-12-13 13:12:21,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34005 conditions, 3237 events. 1676/3237 cut-off events. For 140524/140524 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22898 event pairs, 306 based on Foata normal form. 54/3291 useless extension candidates. Maximal degree in co-relation 33378. Up to 1682 conditions per place. [2022-12-13 13:12:21,345 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 259 selfloop transitions, 291 changer transitions 5/555 dead transitions. [2022-12-13 13:12:21,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 555 transitions, 14113 flow [2022-12-13 13:12:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:12:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:12:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2022-12-13 13:12:21,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23183391003460208 [2022-12-13 13:12:21,347 INFO L175 Difference]: Start difference. First operand has 172 places, 328 transitions, 8436 flow. Second operand 17 states and 134 transitions. [2022-12-13 13:12:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 555 transitions, 14113 flow [2022-12-13 13:12:21,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 555 transitions, 13703 flow, removed 42 selfloop flow, removed 7 redundant places. [2022-12-13 13:12:21,705 INFO L231 Difference]: Finished difference. Result has 189 places, 460 transitions, 12675 flow [2022-12-13 13:12:21,706 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8063, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=12675, PETRI_PLACES=189, PETRI_TRANSITIONS=460} [2022-12-13 13:12:21,706 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 169 predicate places. [2022-12-13 13:12:21,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:21,706 INFO L89 Accepts]: Start accepts. Operand has 189 places, 460 transitions, 12675 flow [2022-12-13 13:12:21,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:21,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:21,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 460 transitions, 12675 flow [2022-12-13 13:12:21,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 460 transitions, 12675 flow [2022-12-13 13:12:21,897 INFO L130 PetriNetUnfolder]: 361/1263 cut-off events. [2022-12-13 13:12:21,898 INFO L131 PetriNetUnfolder]: For 45874/45916 co-relation queries the response was YES. [2022-12-13 13:12:21,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12249 conditions, 1263 events. 361/1263 cut-off events. For 45874/45916 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 11611 event pairs, 14 based on Foata normal form. 3/1263 useless extension candidates. Maximal degree in co-relation 11974. Up to 463 conditions per place. [2022-12-13 13:12:21,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 460 transitions, 12675 flow [2022-12-13 13:12:21,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-13 13:12:21,917 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:21,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 13:12:21,917 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 460 transitions, 12675 flow [2022-12-13 13:12:21,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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-13 13:12:21,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:21,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:21,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:22,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:22,118 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1379540843, now seen corresponding path program 1 times [2022-12-13 13:12:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:22,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334100763] [2022-12-13 13:12:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:22,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:22,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334100763] [2022-12-13 13:12:22,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334100763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:22,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849682781] [2022-12-13 13:12:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:22,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:22,179 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:22,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 13:12:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:22,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:22,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:22,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:22,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849682781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:22,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:22,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 13:12:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921009759] [2022-12-13 13:12:22,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:22,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:12:22,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:12:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:12:22,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 13:12:22,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 460 transitions, 12675 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 13:12:22,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:22,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 13:12:22,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:23,190 INFO L130 PetriNetUnfolder]: 1774/3419 cut-off events. [2022-12-13 13:12:23,190 INFO L131 PetriNetUnfolder]: For 169344/169344 co-relation queries the response was YES. [2022-12-13 13:12:23,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38491 conditions, 3419 events. 1774/3419 cut-off events. For 169344/169344 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24573 event pairs, 384 based on Foata normal form. 4/3423 useless extension candidates. Maximal degree in co-relation 37837. Up to 2366 conditions per place. [2022-12-13 13:12:23,221 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 340 selfloop transitions, 227 changer transitions 1/568 dead transitions. [2022-12-13 13:12:23,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 568 transitions, 15804 flow [2022-12-13 13:12:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:12:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:12:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-12-13 13:12:23,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21218487394957983 [2022-12-13 13:12:23,222 INFO L175 Difference]: Start difference. First operand has 189 places, 460 transitions, 12675 flow. Second operand 14 states and 101 transitions. [2022-12-13 13:12:23,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 568 transitions, 15804 flow [2022-12-13 13:12:23,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 568 transitions, 14520 flow, removed 634 selfloop flow, removed 4 redundant places. [2022-12-13 13:12:23,655 INFO L231 Difference]: Finished difference. Result has 200 places, 484 transitions, 13006 flow [2022-12-13 13:12:23,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11633, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13006, PETRI_PLACES=200, PETRI_TRANSITIONS=484} [2022-12-13 13:12:23,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 180 predicate places. [2022-12-13 13:12:23,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:23,658 INFO L89 Accepts]: Start accepts. Operand has 200 places, 484 transitions, 13006 flow [2022-12-13 13:12:23,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:23,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:23,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 484 transitions, 13006 flow [2022-12-13 13:12:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 484 transitions, 13006 flow [2022-12-13 13:12:23,850 INFO L130 PetriNetUnfolder]: 381/1345 cut-off events. [2022-12-13 13:12:23,851 INFO L131 PetriNetUnfolder]: For 50695/50705 co-relation queries the response was YES. [2022-12-13 13:12:23,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12463 conditions, 1345 events. 381/1345 cut-off events. For 50695/50705 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12553 event pairs, 14 based on Foata normal form. 1/1343 useless extension candidates. Maximal degree in co-relation 12181. Up to 353 conditions per place. [2022-12-13 13:12:23,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 484 transitions, 13006 flow [2022-12-13 13:12:23,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 1830 [2022-12-13 13:12:23,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] $Ultimate##0-->L51-4: Formula: (and (= (+ v_~counter~0_392 4) v_~counter~0_390) (< v_thread1Thread1of1ForFork0_~i~0_188 (+ v_~N~0_131 1)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_223|) (= 7 v_thread1Thread1of1ForFork0_~i~0_188) (not (= (ite (< 0 (+ v_~counter~0_392 1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167| (ite (< 0 (+ v_~counter~0_390 1)) 1 0))) InVars {~counter~0=v_~counter~0_392, ~N~0=v_~N~0_131} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|, ~counter~0=v_~counter~0_390, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_167|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_155|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_149|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_188, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_171|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_223|, ~N~0=v_~N~0_131} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:23,943 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:23,943 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:24,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|) (= v_~counter~0_361 (+ v_~counter~0_363 4)) (= 6 v_thread1Thread1of1ForFork0_~i~0_177) (not (= (ite (< 0 (+ v_~counter~0_363 1)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_203|) (< 5 v_~N~0_127) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149| (ite (< 0 (+ v_~counter~0_363 5)) 1 0))) InVars {~counter~0=v_~counter~0_363, ~N~0=v_~N~0_127} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|, ~counter~0=v_~counter~0_361, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_149|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_144|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_138|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_177, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_153|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_203|, ~N~0=v_~N~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:24,116 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:24,116 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:24,214 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:12:24,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557 [2022-12-13 13:12:24,215 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 484 transitions, 13126 flow [2022-12-13 13:12:24,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 13:12:24,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:24,215 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:24,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 13:12:24,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:24,419 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1552396361, now seen corresponding path program 1 times [2022-12-13 13:12:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126982338] [2022-12-13 13:12:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:24,453 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-13 13:12:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:24,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126982338] [2022-12-13 13:12:24,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126982338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:24,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307752388] [2022-12-13 13:12:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:24,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:24,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:24,456 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:24,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 13:12:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:24,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:24,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:24,555 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-13 13:12:24,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:24,577 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-13 13:12:24,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307752388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:24,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:24,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 13:12:24,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758284587] [2022-12-13 13:12:24,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:24,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:12:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:12:24,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:12:24,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 13:12:24,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 484 transitions, 13126 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:24,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:24,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 13:12:24,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:25,427 INFO L130 PetriNetUnfolder]: 1864/3587 cut-off events. [2022-12-13 13:12:25,427 INFO L131 PetriNetUnfolder]: For 178833/178833 co-relation queries the response was YES. [2022-12-13 13:12:25,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39266 conditions, 3587 events. 1864/3587 cut-off events. For 178833/178833 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25968 event pairs, 365 based on Foata normal form. 4/3591 useless extension candidates. Maximal degree in co-relation 38597. Up to 2305 conditions per place. [2022-12-13 13:12:25,459 INFO L137 encePairwiseOnDemand]: 14/38 looper letters, 331 selfloop transitions, 260 changer transitions 2/593 dead transitions. [2022-12-13 13:12:25,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 593 transitions, 16106 flow [2022-12-13 13:12:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-12-13 13:12:25,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22009569377990432 [2022-12-13 13:12:25,460 INFO L175 Difference]: Start difference. First operand has 201 places, 484 transitions, 13126 flow. Second operand 11 states and 92 transitions. [2022-12-13 13:12:25,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 593 transitions, 16106 flow [2022-12-13 13:12:25,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 593 transitions, 15831 flow, removed 45 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:25,979 INFO L231 Difference]: Finished difference. Result has 206 places, 505 transitions, 14057 flow [2022-12-13 13:12:25,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=12852, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14057, PETRI_PLACES=206, PETRI_TRANSITIONS=505} [2022-12-13 13:12:25,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 186 predicate places. [2022-12-13 13:12:25,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:25,980 INFO L89 Accepts]: Start accepts. Operand has 206 places, 505 transitions, 14057 flow [2022-12-13 13:12:25,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:25,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:25,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 505 transitions, 14057 flow [2022-12-13 13:12:25,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 505 transitions, 14057 flow [2022-12-13 13:12:26,168 INFO L130 PetriNetUnfolder]: 399/1384 cut-off events. [2022-12-13 13:12:26,168 INFO L131 PetriNetUnfolder]: For 54897/54907 co-relation queries the response was YES. [2022-12-13 13:12:26,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13218 conditions, 1384 events. 399/1384 cut-off events. For 54897/54907 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12924 event pairs, 13 based on Foata normal form. 1/1382 useless extension candidates. Maximal degree in co-relation 12992. Up to 365 conditions per place. [2022-12-13 13:12:26,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 505 transitions, 14057 flow [2022-12-13 13:12:26,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 1932 [2022-12-13 13:12:26,189 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:26,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-13 13:12:26,190 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 505 transitions, 14057 flow [2022-12-13 13:12:26,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:26,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:26,190 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:26,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 13:12:26,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:26,393 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:26,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1177024691, now seen corresponding path program 1 times [2022-12-13 13:12:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712047207] [2022-12-13 13:12:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:26,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:26,432 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-13 13:12:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:26,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712047207] [2022-12-13 13:12:26,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712047207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:26,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025937904] [2022-12-13 13:12:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:26,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:26,434 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:26,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 13:12:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:26,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:26,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:26,518 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-13 13:12:26,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:26,532 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-13 13:12:26,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025937904] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:26,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:26,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:12:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637335758] [2022-12-13 13:12:26,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:26,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:12:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:12:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:12:26,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 13:12:26,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 505 transitions, 14057 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:26,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:26,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 13:12:26,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:27,508 INFO L130 PetriNetUnfolder]: 1937/3724 cut-off events. [2022-12-13 13:12:27,508 INFO L131 PetriNetUnfolder]: For 202042/202042 co-relation queries the response was YES. [2022-12-13 13:12:27,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41407 conditions, 3724 events. 1937/3724 cut-off events. For 202042/202042 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 27033 event pairs, 352 based on Foata normal form. 20/3744 useless extension candidates. Maximal degree in co-relation 40859. Up to 2198 conditions per place. [2022-12-13 13:12:27,544 INFO L137 encePairwiseOnDemand]: 14/37 looper letters, 317 selfloop transitions, 290 changer transitions 2/609 dead transitions. [2022-12-13 13:12:27,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 609 transitions, 17042 flow [2022-12-13 13:12:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-13 13:12:27,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24624624624624625 [2022-12-13 13:12:27,547 INFO L175 Difference]: Start difference. First operand has 204 places, 505 transitions, 14057 flow. Second operand 9 states and 82 transitions. [2022-12-13 13:12:27,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 609 transitions, 17042 flow [2022-12-13 13:12:28,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 609 transitions, 16601 flow, removed 123 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:28,088 INFO L231 Difference]: Finished difference. Result has 209 places, 520 transitions, 14984 flow [2022-12-13 13:12:28,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13638, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14984, PETRI_PLACES=209, PETRI_TRANSITIONS=520} [2022-12-13 13:12:28,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 189 predicate places. [2022-12-13 13:12:28,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:28,089 INFO L89 Accepts]: Start accepts. Operand has 209 places, 520 transitions, 14984 flow [2022-12-13 13:12:28,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:28,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:28,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 520 transitions, 14984 flow [2022-12-13 13:12:28,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 520 transitions, 14984 flow [2022-12-13 13:12:28,286 INFO L130 PetriNetUnfolder]: 413/1432 cut-off events. [2022-12-13 13:12:28,286 INFO L131 PetriNetUnfolder]: For 60791/60801 co-relation queries the response was YES. [2022-12-13 13:12:28,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13985 conditions, 1432 events. 413/1432 cut-off events. For 60791/60801 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13453 event pairs, 13 based on Foata normal form. 1/1430 useless extension candidates. Maximal degree in co-relation 13698. Up to 379 conditions per place. [2022-12-13 13:12:28,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 520 transitions, 14984 flow [2022-12-13 13:12:28,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 2014 [2022-12-13 13:12:28,307 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:28,307 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:28,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:28,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-13 13:12:28,424 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 520 transitions, 15005 flow [2022-12-13 13:12:28,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:28,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:28,425 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:28,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:28,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:28,629 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -899328121, now seen corresponding path program 1 times [2022-12-13 13:12:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169084319] [2022-12-13 13:12:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:28,690 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-13 13:12:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:28,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169084319] [2022-12-13 13:12:28,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169084319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:28,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048230223] [2022-12-13 13:12:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:28,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:28,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:28,692 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:28,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 13:12:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:28,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:12:28,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:28,775 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-13 13:12:28,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:28,804 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-13 13:12:28,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048230223] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:28,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:28,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 13:12:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203465234] [2022-12-13 13:12:28,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:28,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:28,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:28,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 13:12:28,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 520 transitions, 15005 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:28,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:28,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 13:12:28,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:29,755 INFO L130 PetriNetUnfolder]: 2033/3918 cut-off events. [2022-12-13 13:12:29,755 INFO L131 PetriNetUnfolder]: For 217983/217983 co-relation queries the response was YES. [2022-12-13 13:12:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44992 conditions, 3918 events. 2033/3918 cut-off events. For 217983/217983 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28688 event pairs, 225 based on Foata normal form. 12/3930 useless extension candidates. Maximal degree in co-relation 44314. Up to 3065 conditions per place. [2022-12-13 13:12:29,789 INFO L137 encePairwiseOnDemand]: 13/38 looper letters, 463 selfloop transitions, 107 changer transitions 26/596 dead transitions. [2022-12-13 13:12:29,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 596 transitions, 17779 flow [2022-12-13 13:12:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 13:12:29,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 13:12:29,790 INFO L175 Difference]: Start difference. First operand has 209 places, 520 transitions, 15005 flow. Second operand 6 states and 76 transitions. [2022-12-13 13:12:29,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 596 transitions, 17779 flow [2022-12-13 13:12:30,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 596 transitions, 17517 flow, removed 122 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:30,403 INFO L231 Difference]: Finished difference. Result has 217 places, 534 transitions, 15758 flow [2022-12-13 13:12:30,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14795, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15758, PETRI_PLACES=217, PETRI_TRANSITIONS=534} [2022-12-13 13:12:30,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 197 predicate places. [2022-12-13 13:12:30,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:30,404 INFO L89 Accepts]: Start accepts. Operand has 217 places, 534 transitions, 15758 flow [2022-12-13 13:12:30,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:30,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:30,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 534 transitions, 15758 flow [2022-12-13 13:12:30,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 534 transitions, 15758 flow [2022-12-13 13:12:30,618 INFO L130 PetriNetUnfolder]: 428/1498 cut-off events. [2022-12-13 13:12:30,618 INFO L131 PetriNetUnfolder]: For 67297/67307 co-relation queries the response was YES. [2022-12-13 13:12:30,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15081 conditions, 1498 events. 428/1498 cut-off events. For 67297/67307 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 14311 event pairs, 19 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 14783. Up to 408 conditions per place. [2022-12-13 13:12:30,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 534 transitions, 15758 flow [2022-12-13 13:12:30,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 2058 [2022-12-13 13:12:30,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_406 5))) (and (= v_~counter~0_404 .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (not (= (ite (< 0 (+ v_~counter~0_406 1)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_196 8) (< 7 v_~N~0_133) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| (ite (< 0 .cse0) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_235|))) InVars {~counter~0=v_~counter~0_406, ~N~0=v_~N~0_133} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|, ~counter~0=v_~counter~0_404, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_176|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_162|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_156|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_196, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_180|, ~N~0=v_~N~0_133, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_235|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:30,639 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:30,639 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:30,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:30,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 374 [2022-12-13 13:12:30,778 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 534 transitions, 15779 flow [2022-12-13 13:12:30,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:30,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:30,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:30,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 13:12:30,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 13:12:30,979 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -745978213, now seen corresponding path program 1 times [2022-12-13 13:12:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129241465] [2022-12-13 13:12:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129241465] [2022-12-13 13:12:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129241465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751840610] [2022-12-13 13:12:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:31,012 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:31,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 13:12:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:31,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:31,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:31,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:31,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751840610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:31,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:31,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-13 13:12:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301574729] [2022-12-13 13:12:31,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:31,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:12:31,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:31,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:12:31,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:12:31,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 13:12:31,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 534 transitions, 15779 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:31,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:31,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 13:12:31,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:32,242 INFO L130 PetriNetUnfolder]: 2132/4114 cut-off events. [2022-12-13 13:12:32,242 INFO L131 PetriNetUnfolder]: For 238616/238616 co-relation queries the response was YES. [2022-12-13 13:12:32,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47579 conditions, 4114 events. 2132/4114 cut-off events. For 238616/238616 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 30371 event pairs, 104 based on Foata normal form. 26/4140 useless extension candidates. Maximal degree in co-relation 46884. Up to 2925 conditions per place. [2022-12-13 13:12:32,276 INFO L137 encePairwiseOnDemand]: 10/39 looper letters, 384 selfloop transitions, 245 changer transitions 12/641 dead transitions. [2022-12-13 13:12:32,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 641 transitions, 19080 flow [2022-12-13 13:12:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:12:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:12:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2022-12-13 13:12:32,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2282051282051282 [2022-12-13 13:12:32,277 INFO L175 Difference]: Start difference. First operand has 217 places, 534 transitions, 15779 flow. Second operand 10 states and 89 transitions. [2022-12-13 13:12:32,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 641 transitions, 19080 flow [2022-12-13 13:12:32,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 641 transitions, 18876 flow, removed 102 selfloop flow, removed 0 redundant places. [2022-12-13 13:12:32,905 INFO L231 Difference]: Finished difference. Result has 229 places, 562 transitions, 17250 flow [2022-12-13 13:12:32,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15655, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17250, PETRI_PLACES=229, PETRI_TRANSITIONS=562} [2022-12-13 13:12:32,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 209 predicate places. [2022-12-13 13:12:32,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:32,906 INFO L89 Accepts]: Start accepts. Operand has 229 places, 562 transitions, 17250 flow [2022-12-13 13:12:32,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:32,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:32,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 562 transitions, 17250 flow [2022-12-13 13:12:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 562 transitions, 17250 flow [2022-12-13 13:12:33,151 INFO L130 PetriNetUnfolder]: 453/1588 cut-off events. [2022-12-13 13:12:33,151 INFO L131 PetriNetUnfolder]: For 75201/75209 co-relation queries the response was YES. [2022-12-13 13:12:33,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16303 conditions, 1588 events. 453/1588 cut-off events. For 75201/75209 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 15353 event pairs, 19 based on Foata normal form. 0/1585 useless extension candidates. Maximal degree in co-relation 15994. Up to 428 conditions per place. [2022-12-13 13:12:33,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 562 transitions, 17250 flow [2022-12-13 13:12:33,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 2186 [2022-12-13 13:12:33,183 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [290] $Ultimate##0-->L51-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (= (ite (< 0 (+ v_~counter~0_202 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (= v_~counter~0_202 (+ v_~counter~0_204 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (< v_thread1Thread1of1ForFork0_~i~0_91 (+ 1 v_~N~0_89)) (= 2 v_thread1Thread1of1ForFork0_~i~0_91)) InVars {~counter~0=v_~counter~0_204, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, ~counter~0=v_~counter~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_60|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_91, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~N~0=v_~N~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [292] L41-4-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_100 v_~N~0_93) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_106| (+ |v_thread2Thread1of1ForFork1_~i~1#1_107| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_107| v_~N~0_93) (= v_~counter~0_219 v_~counter~0_217) (= (+ v_thread1Thread1of1ForFork0_~i~0_100 1) v_thread1Thread1of1ForFork0_~i~0_99) (= (ite (< 0 (+ v_~counter~0_217 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|)) InVars {~counter~0=v_~counter~0_219, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_100, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_107|, ~N~0=v_~N~0_93} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, ~counter~0=v_~counter~0_217, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_71|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_74|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_68|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_99, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_106|, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:33,184 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:33,184 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:33,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [290] $Ultimate##0-->L51-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (= (ite (< 0 (+ v_~counter~0_202 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (= v_~counter~0_202 (+ v_~counter~0_204 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (< v_thread1Thread1of1ForFork0_~i~0_91 (+ 1 v_~N~0_89)) (= 2 v_thread1Thread1of1ForFork0_~i~0_91)) InVars {~counter~0=v_~counter~0_204, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, ~counter~0=v_~counter~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_60|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_91, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~N~0=v_~N~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:33,325 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:33,325 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:33,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:33,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 502 [2022-12-13 13:12:33,408 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 562 transitions, 17345 flow [2022-12-13 13:12:33,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:33,408 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:33,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:33,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 13:12:33,613 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash -897830084, now seen corresponding path program 1 times [2022-12-13 13:12:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641891696] [2022-12-13 13:12:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:33,637 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-13 13:12:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:33,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641891696] [2022-12-13 13:12:33,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641891696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:33,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269458449] [2022-12-13 13:12:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:33,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:33,638 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 13:12:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:33,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:33,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:33,716 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-13 13:12:33,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:33,728 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-13 13:12:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269458449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:33,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:33,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:12:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528573308] [2022-12-13 13:12:33,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:33,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:12:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:33,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:12:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:12:33,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 13:12:33,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 562 transitions, 17345 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:33,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 13:12:33,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:34,928 INFO L130 PetriNetUnfolder]: 2230/4296 cut-off events. [2022-12-13 13:12:34,928 INFO L131 PetriNetUnfolder]: For 280874/280874 co-relation queries the response was YES. [2022-12-13 13:12:34,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50997 conditions, 4296 events. 2230/4296 cut-off events. For 280874/280874 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 32069 event pairs, 361 based on Foata normal form. 40/4336 useless extension candidates. Maximal degree in co-relation 50228. Up to 2110 conditions per place. [2022-12-13 13:12:34,972 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 302 selfloop transitions, 377 changer transitions 4/683 dead transitions. [2022-12-13 13:12:34,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 683 transitions, 20898 flow [2022-12-13 13:12:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2022-12-13 13:12:34,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23577235772357724 [2022-12-13 13:12:34,973 INFO L175 Difference]: Start difference. First operand has 229 places, 562 transitions, 17345 flow. Second operand 9 states and 87 transitions. [2022-12-13 13:12:34,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 683 transitions, 20898 flow [2022-12-13 13:12:35,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 683 transitions, 20559 flow, removed 133 selfloop flow, removed 4 redundant places. [2022-12-13 13:12:35,815 INFO L231 Difference]: Finished difference. Result has 235 places, 585 transitions, 18785 flow [2022-12-13 13:12:35,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=17014, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18785, PETRI_PLACES=235, PETRI_TRANSITIONS=585} [2022-12-13 13:12:35,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 215 predicate places. [2022-12-13 13:12:35,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:35,816 INFO L89 Accepts]: Start accepts. Operand has 235 places, 585 transitions, 18785 flow [2022-12-13 13:12:35,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:35,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:35,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 585 transitions, 18785 flow [2022-12-13 13:12:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 585 transitions, 18785 flow [2022-12-13 13:12:36,086 INFO L130 PetriNetUnfolder]: 473/1674 cut-off events. [2022-12-13 13:12:36,086 INFO L131 PetriNetUnfolder]: For 84183/84191 co-relation queries the response was YES. [2022-12-13 13:12:36,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17557 conditions, 1674 events. 473/1674 cut-off events. For 84183/84191 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 16381 event pairs, 19 based on Foata normal form. 0/1671 useless extension candidates. Maximal degree in co-relation 17036. Up to 439 conditions per place. [2022-12-13 13:12:36,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 585 transitions, 18785 flow [2022-12-13 13:12:36,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 2296 [2022-12-13 13:12:36,115 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:36,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-13 13:12:36,115 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 585 transitions, 18785 flow [2022-12-13 13:12:36,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:36,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:36,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:36,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 13:12:36,320 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash -369594427, now seen corresponding path program 1 times [2022-12-13 13:12:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:36,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756518823] [2022-12-13 13:12:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756518823] [2022-12-13 13:12:36,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756518823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014800518] [2022-12-13 13:12:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:36,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:36,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:36,349 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:36,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 13:12:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:36,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:12:36,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:36,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:36,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014800518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:36,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:36,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:12:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10875274] [2022-12-13 13:12:36,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:36,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:12:36,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:12:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:36,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 13:12:36,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 585 transitions, 18785 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:36,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 13:12:36,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:37,776 INFO L130 PetriNetUnfolder]: 2304/4440 cut-off events. [2022-12-13 13:12:37,776 INFO L131 PetriNetUnfolder]: For 314554/314554 co-relation queries the response was YES. [2022-12-13 13:12:37,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54288 conditions, 4440 events. 2304/4440 cut-off events. For 314554/314554 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 33536 event pairs, 534 based on Foata normal form. 40/4480 useless extension candidates. Maximal degree in co-relation 52800. Up to 3155 conditions per place. [2022-12-13 13:12:37,820 INFO L137 encePairwiseOnDemand]: 13/40 looper letters, 399 selfloop transitions, 285 changer transitions 12/696 dead transitions. [2022-12-13 13:12:37,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 696 transitions, 21967 flow [2022-12-13 13:12:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:12:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:12:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-12-13 13:12:37,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 13:12:37,821 INFO L175 Difference]: Start difference. First operand has 234 places, 585 transitions, 18785 flow. Second operand 12 states and 104 transitions. [2022-12-13 13:12:37,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 696 transitions, 21967 flow [2022-12-13 13:12:38,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 696 transitions, 21338 flow, removed 276 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:38,700 INFO L231 Difference]: Finished difference. Result has 249 places, 614 transitions, 19747 flow [2022-12-13 13:12:38,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=18156, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19747, PETRI_PLACES=249, PETRI_TRANSITIONS=614} [2022-12-13 13:12:38,701 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 229 predicate places. [2022-12-13 13:12:38,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:38,701 INFO L89 Accepts]: Start accepts. Operand has 249 places, 614 transitions, 19747 flow [2022-12-13 13:12:38,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:38,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:38,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 614 transitions, 19747 flow [2022-12-13 13:12:38,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 614 transitions, 19747 flow [2022-12-13 13:12:39,019 INFO L130 PetriNetUnfolder]: 489/1710 cut-off events. [2022-12-13 13:12:39,020 INFO L131 PetriNetUnfolder]: For 94844/94890 co-relation queries the response was YES. [2022-12-13 13:12:39,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18738 conditions, 1710 events. 489/1710 cut-off events. For 94844/94890 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16698 event pairs, 19 based on Foata normal form. 3/1709 useless extension candidates. Maximal degree in co-relation 18193. Up to 448 conditions per place. [2022-12-13 13:12:39,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 614 transitions, 19747 flow [2022-12-13 13:12:39,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 2386 [2022-12-13 13:12:39,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (+ v_~counter~0_459 1)) 1 0))) (and (not (= .cse0 0)) (= v_~counter~0_459 (+ v_~counter~0_461 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_275|) (< v_thread1Thread1of1ForFork0_~i~0_218 (+ v_~N~0_145 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|) (= 3 v_thread1Thread1of1ForFork0_~i~0_218) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| .cse0))) InVars {~counter~0=v_~counter~0_461, ~N~0=v_~N~0_145} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|, ~counter~0=v_~counter~0_459, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_210|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_184|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_178|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_218, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_214|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_275|, ~N~0=v_~N~0_145} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:12:39,203 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:39,203 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:39,290 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:12:39,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 589 [2022-12-13 13:12:39,290 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 613 transitions, 19785 flow [2022-12-13 13:12:39,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:39,291 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:39,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 13:12:39,491 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1815185268, now seen corresponding path program 1 times [2022-12-13 13:12:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746398895] [2022-12-13 13:12:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:39,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746398895] [2022-12-13 13:12:39,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746398895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031192406] [2022-12-13 13:12:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:39,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:39,528 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:39,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 13:12:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:39,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:39,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:39,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:39,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031192406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:39,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:39,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 13:12:39,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215346073] [2022-12-13 13:12:39,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:39,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:12:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:39,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:12:39,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:12:39,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 13:12:39,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 613 transitions, 19785 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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-13 13:12:39,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:39,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 13:12:39,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:41,194 INFO L130 PetriNetUnfolder]: 2494/4782 cut-off events. [2022-12-13 13:12:41,195 INFO L131 PetriNetUnfolder]: For 377168/377168 co-relation queries the response was YES. [2022-12-13 13:12:41,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60154 conditions, 4782 events. 2494/4782 cut-off events. For 377168/377168 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 36095 event pairs, 429 based on Foata normal form. 70/4852 useless extension candidates. Maximal degree in co-relation 58614. Up to 2566 conditions per place. [2022-12-13 13:12:41,254 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 374 selfloop transitions, 417 changer transitions 11/802 dead transitions. [2022-12-13 13:12:41,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 802 transitions, 24902 flow [2022-12-13 13:12:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:12:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:12:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2022-12-13 13:12:41,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18627450980392157 [2022-12-13 13:12:41,255 INFO L175 Difference]: Start difference. First operand has 248 places, 613 transitions, 19785 flow. Second operand 17 states and 133 transitions. [2022-12-13 13:12:41,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 802 transitions, 24902 flow [2022-12-13 13:12:42,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 802 transitions, 24514 flow, removed 187 selfloop flow, removed 2 redundant places. [2022-12-13 13:12:42,343 INFO L231 Difference]: Finished difference. Result has 270 places, 676 transitions, 22593 flow [2022-12-13 13:12:42,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=19429, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=22593, PETRI_PLACES=270, PETRI_TRANSITIONS=676} [2022-12-13 13:12:42,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 250 predicate places. [2022-12-13 13:12:42,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:42,344 INFO L89 Accepts]: Start accepts. Operand has 270 places, 676 transitions, 22593 flow [2022-12-13 13:12:42,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:42,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:42,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 676 transitions, 22593 flow [2022-12-13 13:12:42,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 676 transitions, 22593 flow [2022-12-13 13:12:42,744 INFO L130 PetriNetUnfolder]: 531/1832 cut-off events. [2022-12-13 13:12:42,744 INFO L131 PetriNetUnfolder]: For 110455/110501 co-relation queries the response was YES. [2022-12-13 13:12:42,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20937 conditions, 1832 events. 531/1832 cut-off events. For 110455/110501 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 17954 event pairs, 19 based on Foata normal form. 3/1831 useless extension candidates. Maximal degree in co-relation 20360. Up to 477 conditions per place. [2022-12-13 13:12:42,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 676 transitions, 22593 flow [2022-12-13 13:12:42,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 2634 [2022-12-13 13:12:42,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] $Ultimate##0-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_231 (+ v_~N~0_151 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| (ite (< 1 v_~counter~0_483) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|) (= v_~counter~0_483 (+ v_~counter~0_485 3)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_293| 1) (= v_thread1Thread1of1ForFork0_~i~0_231 4)) InVars {~counter~0=v_~counter~0_485, ~N~0=v_~N~0_151} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|, ~counter~0=v_~counter~0_483, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_225|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_197|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_191|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_231, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_229|, ~N~0=v_~N~0_151, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_293|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:42,773 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:42,773 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:12:42,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:42,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-13 13:12:42,854 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 676 transitions, 22617 flow [2022-12-13 13:12:42,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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-13 13:12:42,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:42,854 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:42,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 13:12:43,056 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2135367415, now seen corresponding path program 1 times [2022-12-13 13:12:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:43,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739858057] [2022-12-13 13:12:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739858057] [2022-12-13 13:12:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739858057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350302474] [2022-12-13 13:12:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:43,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:43,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:43,109 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:43,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 13:12:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:43,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:43,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:43,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:43,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350302474] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:43,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:43,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 13:12:43,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217900825] [2022-12-13 13:12:43,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:43,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:12:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:43,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:12:43,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:12:43,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 13:12:43,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 676 transitions, 22617 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:43,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:43,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 13:12:43,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:45,490 INFO L130 PetriNetUnfolder]: 3066/5924 cut-off events. [2022-12-13 13:12:45,490 INFO L131 PetriNetUnfolder]: For 508313/508313 co-relation queries the response was YES. [2022-12-13 13:12:45,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80600 conditions, 5924 events. 3066/5924 cut-off events. For 508313/508313 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 46606 event pairs, 70 based on Foata normal form. 46/5970 useless extension candidates. Maximal degree in co-relation 78636. Up to 1591 conditions per place. [2022-12-13 13:12:45,556 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 193 selfloop transitions, 803 changer transitions 18/1014 dead transitions. [2022-12-13 13:12:45,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1014 transitions, 33772 flow [2022-12-13 13:12:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 13:12:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 13:12:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 204 transitions. [2022-12-13 13:12:45,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15178571428571427 [2022-12-13 13:12:45,557 INFO L175 Difference]: Start difference. First operand has 269 places, 676 transitions, 22617 flow. Second operand 32 states and 204 transitions. [2022-12-13 13:12:45,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1014 transitions, 33772 flow [2022-12-13 13:12:47,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 1014 transitions, 32835 flow, removed 427 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:47,357 INFO L231 Difference]: Finished difference. Result has 299 places, 901 transitions, 31695 flow [2022-12-13 13:12:47,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=22024, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=31695, PETRI_PLACES=299, PETRI_TRANSITIONS=901} [2022-12-13 13:12:47,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 279 predicate places. [2022-12-13 13:12:47,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:47,358 INFO L89 Accepts]: Start accepts. Operand has 299 places, 901 transitions, 31695 flow [2022-12-13 13:12:47,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:47,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:47,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 901 transitions, 31695 flow [2022-12-13 13:12:47,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 901 transitions, 31695 flow [2022-12-13 13:12:47,833 INFO L130 PetriNetUnfolder]: 639/2192 cut-off events. [2022-12-13 13:12:47,833 INFO L131 PetriNetUnfolder]: For 145328/145365 co-relation queries the response was YES. [2022-12-13 13:12:47,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27264 conditions, 2192 events. 639/2192 cut-off events. For 145328/145365 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 22254 event pairs, 1 based on Foata normal form. 3/2193 useless extension candidates. Maximal degree in co-relation 26410. Up to 613 conditions per place. [2022-12-13 13:12:47,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 901 transitions, 31695 flow [2022-12-13 13:12:47,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 3356 [2022-12-13 13:12:47,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:12:47,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:12:47,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 584 [2022-12-13 13:12:47,942 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 900 transitions, 31683 flow [2022-12-13 13:12:47,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:47,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:47,942 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:47,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 13:12:48,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-13 13:12:48,147 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 667301673, now seen corresponding path program 1 times [2022-12-13 13:12:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:48,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629855379] [2022-12-13 13:12:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:48,195 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-13 13:12:48,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:48,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629855379] [2022-12-13 13:12:48,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629855379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:48,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499697821] [2022-12-13 13:12:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:48,197 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:48,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 13:12:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:48,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:12:48,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:48,273 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-13 13:12:48,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:48,291 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-13 13:12:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499697821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:48,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:48,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 13:12:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532951042] [2022-12-13 13:12:48,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:48,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:12:48,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 13:12:48,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 900 transitions, 31683 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:48,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:48,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 13:12:48,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:50,577 INFO L130 PetriNetUnfolder]: 3088/5938 cut-off events. [2022-12-13 13:12:50,577 INFO L131 PetriNetUnfolder]: For 531931/531931 co-relation queries the response was YES. [2022-12-13 13:12:50,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84199 conditions, 5938 events. 3088/5938 cut-off events. For 531931/531931 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 46565 event pairs, 346 based on Foata normal form. 24/5962 useless extension candidates. Maximal degree in co-relation 82518. Up to 4792 conditions per place. [2022-12-13 13:12:50,649 INFO L137 encePairwiseOnDemand]: 15/43 looper letters, 806 selfloop transitions, 150 changer transitions 26/982 dead transitions. [2022-12-13 13:12:50,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 982 transitions, 36254 flow [2022-12-13 13:12:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 13:12:50,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34418604651162793 [2022-12-13 13:12:50,650 INFO L175 Difference]: Start difference. First operand has 298 places, 900 transitions, 31683 flow. Second operand 5 states and 74 transitions. [2022-12-13 13:12:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 982 transitions, 36254 flow [2022-12-13 13:12:54,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 982 transitions, 31337 flow, removed 2382 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:54,340 INFO L231 Difference]: Finished difference. Result has 299 places, 905 transitions, 28570 flow [2022-12-13 13:12:54,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=27646, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28570, PETRI_PLACES=299, PETRI_TRANSITIONS=905} [2022-12-13 13:12:54,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 279 predicate places. [2022-12-13 13:12:54,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:54,341 INFO L89 Accepts]: Start accepts. Operand has 299 places, 905 transitions, 28570 flow [2022-12-13 13:12:54,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:54,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:54,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 905 transitions, 28570 flow [2022-12-13 13:12:54,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 905 transitions, 28570 flow [2022-12-13 13:12:54,813 INFO L130 PetriNetUnfolder]: 643/2247 cut-off events. [2022-12-13 13:12:54,813 INFO L131 PetriNetUnfolder]: For 78819/78853 co-relation queries the response was YES. [2022-12-13 13:12:54,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22536 conditions, 2247 events. 643/2247 cut-off events. For 78819/78853 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 23096 event pairs, 1 based on Foata normal form. 3/2247 useless extension candidates. Maximal degree in co-relation 22079. Up to 493 conditions per place. [2022-12-13 13:12:54,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 905 transitions, 28570 flow [2022-12-13 13:12:54,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 3360 [2022-12-13 13:12:54,847 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:12:54,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-13 13:12:54,847 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 905 transitions, 28570 flow [2022-12-13 13:12:54,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:54,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:54,848 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:54,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 13:12:55,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:55,048 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:12:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -693387380, now seen corresponding path program 2 times [2022-12-13 13:12:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:55,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670376437] [2022-12-13 13:12:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:55,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670376437] [2022-12-13 13:12:55,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670376437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:55,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64331812] [2022-12-13 13:12:55,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:12:55,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:55,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:12:55,120 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:55,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 13:12:55,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:12:55,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:12:55,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:12:55,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:55,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:55,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64331812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:55,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:55,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 13:12:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495124569] [2022-12-13 13:12:55,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:55,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:55,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:55,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 13:12:55,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 905 transitions, 28570 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:55,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:55,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 13:12:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:57,912 INFO L130 PetriNetUnfolder]: 3810/7330 cut-off events. [2022-12-13 13:12:57,913 INFO L131 PetriNetUnfolder]: For 316365/316365 co-relation queries the response was YES. [2022-12-13 13:12:57,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83231 conditions, 7330 events. 3810/7330 cut-off events. For 316365/316365 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 59392 event pairs, 341 based on Foata normal form. 17/7347 useless extension candidates. Maximal degree in co-relation 81543. Up to 4261 conditions per place. [2022-12-13 13:12:57,986 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 802 selfloop transitions, 366 changer transitions 75/1243 dead transitions. [2022-12-13 13:12:57,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 1243 transitions, 39366 flow [2022-12-13 13:12:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 13:12:57,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3373015873015873 [2022-12-13 13:12:57,987 INFO L175 Difference]: Start difference. First operand has 299 places, 905 transitions, 28570 flow. Second operand 6 states and 85 transitions. [2022-12-13 13:12:57,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 1243 transitions, 39366 flow [2022-12-13 13:13:00,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1243 transitions, 39131 flow, removed 104 selfloop flow, removed 1 redundant places. [2022-12-13 13:13:00,045 INFO L231 Difference]: Finished difference. Result has 307 places, 1039 transitions, 33761 flow [2022-12-13 13:13:00,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=28385, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33761, PETRI_PLACES=307, PETRI_TRANSITIONS=1039} [2022-12-13 13:13:00,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 287 predicate places. [2022-12-13 13:13:00,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:00,046 INFO L89 Accepts]: Start accepts. Operand has 307 places, 1039 transitions, 33761 flow [2022-12-13 13:13:00,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:00,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:00,053 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 1039 transitions, 33761 flow [2022-12-13 13:13:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 1039 transitions, 33761 flow [2022-12-13 13:13:00,728 INFO L130 PetriNetUnfolder]: 774/2778 cut-off events. [2022-12-13 13:13:00,728 INFO L131 PetriNetUnfolder]: For 94257/94298 co-relation queries the response was YES. [2022-12-13 13:13:00,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28023 conditions, 2778 events. 774/2778 cut-off events. For 94257/94298 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 30016 event pairs, 4 based on Foata normal form. 2/2777 useless extension candidates. Maximal degree in co-relation 27491. Up to 655 conditions per place. [2022-12-13 13:13:00,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 1039 transitions, 33761 flow [2022-12-13 13:13:00,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 3808 [2022-12-13 13:13:00,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:13:00,906 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:13:00,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 861 [2022-12-13 13:13:00,907 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 1038 transitions, 33771 flow [2022-12-13 13:13:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:00,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:00,907 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:00,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-13 13:13:01,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:01,112 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1048476332, now seen corresponding path program 1 times [2022-12-13 13:13:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:01,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057706471] [2022-12-13 13:13:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:01,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057706471] [2022-12-13 13:13:01,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057706471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115178851] [2022-12-13 13:13:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:01,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:01,143 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:01,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 13:13:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:01,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:13:01,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:01,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:01,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115178851] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:01,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:01,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:13:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331993712] [2022-12-13 13:13:01,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:01,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:13:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:13:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:13:01,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 13:13:01,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 1038 transitions, 33771 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:01,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:01,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 13:13:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:04,545 INFO L130 PetriNetUnfolder]: 3907/7481 cut-off events. [2022-12-13 13:13:04,546 INFO L131 PetriNetUnfolder]: For 363355/363355 co-relation queries the response was YES. [2022-12-13 13:13:04,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87956 conditions, 7481 events. 3907/7481 cut-off events. For 363355/363355 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 61307 event pairs, 507 based on Foata normal form. 390/7871 useless extension candidates. Maximal degree in co-relation 86338. Up to 3442 conditions per place. [2022-12-13 13:13:04,620 INFO L137 encePairwiseOnDemand]: 15/42 looper letters, 461 selfloop transitions, 804 changer transitions 27/1292 dead transitions. [2022-12-13 13:13:04,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1292 transitions, 43027 flow [2022-12-13 13:13:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:13:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:13:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-12-13 13:13:04,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21825396825396826 [2022-12-13 13:13:04,621 INFO L175 Difference]: Start difference. First operand has 302 places, 1038 transitions, 33771 flow. Second operand 12 states and 110 transitions. [2022-12-13 13:13:04,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1292 transitions, 43027 flow [2022-12-13 13:13:07,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1292 transitions, 41958 flow, removed 444 selfloop flow, removed 4 redundant places. [2022-12-13 13:13:07,045 INFO L231 Difference]: Finished difference. Result has 316 places, 1178 transitions, 40073 flow [2022-12-13 13:13:07,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=32895, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=670, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=40073, PETRI_PLACES=316, PETRI_TRANSITIONS=1178} [2022-12-13 13:13:07,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 296 predicate places. [2022-12-13 13:13:07,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:07,046 INFO L89 Accepts]: Start accepts. Operand has 316 places, 1178 transitions, 40073 flow [2022-12-13 13:13:07,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:07,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:07,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 1178 transitions, 40073 flow [2022-12-13 13:13:07,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 316 places, 1178 transitions, 40073 flow [2022-12-13 13:13:07,756 INFO L130 PetriNetUnfolder]: 840/2905 cut-off events. [2022-12-13 13:13:07,757 INFO L131 PetriNetUnfolder]: For 105280/105321 co-relation queries the response was YES. [2022-12-13 13:13:07,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30729 conditions, 2905 events. 840/2905 cut-off events. For 105280/105321 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 31548 event pairs, 4 based on Foata normal form. 2/2902 useless extension candidates. Maximal degree in co-relation 30126. Up to 697 conditions per place. [2022-12-13 13:13:07,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 1178 transitions, 40073 flow [2022-12-13 13:13:07,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 4250 [2022-12-13 13:13:07,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] $Ultimate##0-->L41-4: Formula: (and (= 7 v_thread1Thread1of1ForFork0_~i~0_179) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (= v_~counter~0_367 (+ v_~counter~0_369 6)) (< 6 v_~N~0_129) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| (ite (< 0 (+ v_~counter~0_369 1)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| 1)) InVars {~counter~0=v_~counter~0_369, ~N~0=v_~N~0_129} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, ~counter~0=v_~counter~0_367, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_153|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_146|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_179, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_157|, ~N~0=v_~N~0_129, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:13:07,865 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:07,865 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:07,964 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:13:07,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 919 [2022-12-13 13:13:07,965 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 1178 transitions, 40109 flow [2022-12-13 13:13:07,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:07,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:07,965 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:07,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 13:13:08,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 13:13:08,170 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2003990803, now seen corresponding path program 1 times [2022-12-13 13:13:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:08,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735064] [2022-12-13 13:13:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:08,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735064] [2022-12-13 13:13:08,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:08,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327128563] [2022-12-13 13:13:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:08,203 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 13:13:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:08,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:13:08,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:08,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:08,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327128563] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:08,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:08,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 13:13:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111275041] [2022-12-13 13:13:08,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:08,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:13:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:13:08,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:13:08,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 13:13:08,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1178 transitions, 40109 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:08,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:08,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 13:13:08,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:12,041 INFO L130 PetriNetUnfolder]: 4148/7940 cut-off events. [2022-12-13 13:13:12,041 INFO L131 PetriNetUnfolder]: For 391949/391949 co-relation queries the response was YES. [2022-12-13 13:13:12,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96256 conditions, 7940 events. 4148/7940 cut-off events. For 391949/391949 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 65740 event pairs, 669 based on Foata normal form. 64/8004 useless extension candidates. Maximal degree in co-relation 94564. Up to 4550 conditions per place. [2022-12-13 13:13:12,126 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 814 selfloop transitions, 634 changer transitions 2/1450 dead transitions. [2022-12-13 13:13:12,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1450 transitions, 49231 flow [2022-12-13 13:13:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:13:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:13:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2022-12-13 13:13:12,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18914728682170542 [2022-12-13 13:13:12,128 INFO L175 Difference]: Start difference. First operand has 316 places, 1178 transitions, 40109 flow. Second operand 15 states and 122 transitions. [2022-12-13 13:13:12,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1450 transitions, 49231 flow [2022-12-13 13:13:15,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 1450 transitions, 47606 flow, removed 543 selfloop flow, removed 3 redundant places. [2022-12-13 13:13:15,204 INFO L231 Difference]: Finished difference. Result has 330 places, 1261 transitions, 43487 flow [2022-12-13 13:13:15,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=38642, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=561, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=43487, PETRI_PLACES=330, PETRI_TRANSITIONS=1261} [2022-12-13 13:13:15,206 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 310 predicate places. [2022-12-13 13:13:15,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:15,206 INFO L89 Accepts]: Start accepts. Operand has 330 places, 1261 transitions, 43487 flow [2022-12-13 13:13:15,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:15,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:15,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 1261 transitions, 43487 flow [2022-12-13 13:13:15,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 1261 transitions, 43487 flow [2022-12-13 13:13:16,039 INFO L130 PetriNetUnfolder]: 906/3142 cut-off events. [2022-12-13 13:13:16,039 INFO L131 PetriNetUnfolder]: For 115318/115360 co-relation queries the response was YES. [2022-12-13 13:13:16,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33344 conditions, 3142 events. 906/3142 cut-off events. For 115318/115360 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 34622 event pairs, 4 based on Foata normal form. 2/3139 useless extension candidates. Maximal degree in co-relation 32755. Up to 761 conditions per place. [2022-12-13 13:13:16,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 1261 transitions, 43487 flow [2022-12-13 13:13:16,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 4608 [2022-12-13 13:13:16,095 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:16,095 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:16,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:13:16,208 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1002 [2022-12-13 13:13:16,208 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 1261 transitions, 43518 flow [2022-12-13 13:13:16,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:16,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:16,209 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:16,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 13:13:16,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:16,413 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:16,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1656321263, now seen corresponding path program 1 times [2022-12-13 13:13:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:16,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756202340] [2022-12-13 13:13:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:16,466 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-13 13:13:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756202340] [2022-12-13 13:13:16,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756202340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261218931] [2022-12-13 13:13:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:16,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:16,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:16,467 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 13:13:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:16,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:13:16,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:16,559 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-13 13:13:16,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:16,584 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-13 13:13:16,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261218931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:16,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:16,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 13:13:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790701057] [2022-12-13 13:13:16,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:16,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:13:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:13:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:13:16,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 13:13:16,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1261 transitions, 43518 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:16,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:16,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 13:13:16,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:20,217 INFO L130 PetriNetUnfolder]: 4196/8056 cut-off events. [2022-12-13 13:13:20,217 INFO L131 PetriNetUnfolder]: For 378698/378698 co-relation queries the response was YES. [2022-12-13 13:13:20,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98496 conditions, 8056 events. 4196/8056 cut-off events. For 378698/378698 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 66865 event pairs, 389 based on Foata normal form. 5/8061 useless extension candidates. Maximal degree in co-relation 96647. Up to 6882 conditions per place. [2022-12-13 13:13:20,304 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 1135 selfloop transitions, 182 changer transitions 30/1347 dead transitions. [2022-12-13 13:13:20,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1347 transitions, 47840 flow [2022-12-13 13:13:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:13:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:13:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 13:13:20,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2022-12-13 13:13:20,305 INFO L175 Difference]: Start difference. First operand has 330 places, 1261 transitions, 43518 flow. Second operand 6 states and 82 transitions. [2022-12-13 13:13:20,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1347 transitions, 47840 flow [2022-12-13 13:13:22,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1347 transitions, 47498 flow, removed 152 selfloop flow, removed 4 redundant places. [2022-12-13 13:13:22,944 INFO L231 Difference]: Finished difference. Result has 334 places, 1267 transitions, 44040 flow [2022-12-13 13:13:22,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=43182, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1079, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=44040, PETRI_PLACES=334, PETRI_TRANSITIONS=1267} [2022-12-13 13:13:22,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 314 predicate places. [2022-12-13 13:13:22,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:22,946 INFO L89 Accepts]: Start accepts. Operand has 334 places, 1267 transitions, 44040 flow [2022-12-13 13:13:22,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:22,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:22,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 1267 transitions, 44040 flow [2022-12-13 13:13:22,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 1267 transitions, 44040 flow [2022-12-13 13:13:23,718 INFO L130 PetriNetUnfolder]: 913/3164 cut-off events. [2022-12-13 13:13:23,718 INFO L131 PetriNetUnfolder]: For 117054/117103 co-relation queries the response was YES. [2022-12-13 13:13:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33935 conditions, 3164 events. 913/3164 cut-off events. For 117054/117103 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 34945 event pairs, 6 based on Foata normal form. 2/3161 useless extension candidates. Maximal degree in co-relation 33306. Up to 772 conditions per place. [2022-12-13 13:13:23,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 1267 transitions, 44040 flow [2022-12-13 13:13:23,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 4624 [2022-12-13 13:13:23,779 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:13:23,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 834 [2022-12-13 13:13:23,780 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 1267 transitions, 44040 flow [2022-12-13 13:13:23,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:23,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:23,780 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:23,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 13:13:23,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 13:13:23,981 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 232520517, now seen corresponding path program 1 times [2022-12-13 13:13:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:23,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875841086] [2022-12-13 13:13:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:24,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875841086] [2022-12-13 13:13:24,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875841086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:24,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856948554] [2022-12-13 13:13:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:24,034 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:24,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 13:13:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:24,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:13:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:24,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:24,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856948554] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:24,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:24,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 13:13:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350621213] [2022-12-13 13:13:24,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:24,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:13:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:13:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:13:24,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 13:13:24,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1267 transitions, 44040 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:24,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:24,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 13:13:24,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:28,124 INFO L130 PetriNetUnfolder]: 4351/8360 cut-off events. [2022-12-13 13:13:28,124 INFO L131 PetriNetUnfolder]: For 393430/393430 co-relation queries the response was YES. [2022-12-13 13:13:28,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102268 conditions, 8360 events. 4351/8360 cut-off events. For 393430/393430 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 69911 event pairs, 349 based on Foata normal form. 12/8372 useless extension candidates. Maximal degree in co-relation 100421. Up to 5120 conditions per place. [2022-12-13 13:13:28,231 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 965 selfloop transitions, 451 changer transitions 43/1459 dead transitions. [2022-12-13 13:13:28,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1459 transitions, 51268 flow [2022-12-13 13:13:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:13:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:13:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-13 13:13:28,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2022-12-13 13:13:28,232 INFO L175 Difference]: Start difference. First operand has 334 places, 1267 transitions, 44040 flow. Second operand 6 states and 87 transitions. [2022-12-13 13:13:28,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1459 transitions, 51268 flow [2022-12-13 13:13:31,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1459 transitions, 51209 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 13:13:31,124 INFO L231 Difference]: Finished difference. Result has 342 places, 1297 transitions, 46772 flow [2022-12-13 13:13:31,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=43991, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=425, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=46772, PETRI_PLACES=342, PETRI_TRANSITIONS=1297} [2022-12-13 13:13:31,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 322 predicate places. [2022-12-13 13:13:31,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:31,125 INFO L89 Accepts]: Start accepts. Operand has 342 places, 1297 transitions, 46772 flow [2022-12-13 13:13:31,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:31,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:31,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 342 places, 1297 transitions, 46772 flow [2022-12-13 13:13:31,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 1297 transitions, 46772 flow [2022-12-13 13:13:32,014 INFO L130 PetriNetUnfolder]: 942/3273 cut-off events. [2022-12-13 13:13:32,014 INFO L131 PetriNetUnfolder]: For 124897/124897 co-relation queries the response was YES. [2022-12-13 13:13:32,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36068 conditions, 3273 events. 942/3273 cut-off events. For 124897/124897 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 36417 event pairs, 8 based on Foata normal form. 0/3269 useless extension candidates. Maximal degree in co-relation 35409. Up to 812 conditions per place. [2022-12-13 13:13:32,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 1297 transitions, 46772 flow [2022-12-13 13:13:32,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 4724 [2022-12-13 13:13:32,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:13:32,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 955 [2022-12-13 13:13:32,080 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 1297 transitions, 46772 flow [2022-12-13 13:13:32,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:32,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:32,080 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:32,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 13:13:32,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:32,284 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash 446513277, now seen corresponding path program 2 times [2022-12-13 13:13:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:32,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479691522] [2022-12-13 13:13:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479691522] [2022-12-13 13:13:32,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479691522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:32,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523619084] [2022-12-13 13:13:32,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:13:32,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:32,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:32,331 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:32,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 13:13:32,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:13:32,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:13:32,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:13:32,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:32,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:32,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523619084] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:32,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:32,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 13:13:32,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788789538] [2022-12-13 13:13:32,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:32,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:13:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:32,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:13:32,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:13:32,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 13:13:32,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1297 transitions, 46772 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:32,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:32,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 13:13:32,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:36,880 INFO L130 PetriNetUnfolder]: 4581/8835 cut-off events. [2022-12-13 13:13:36,880 INFO L131 PetriNetUnfolder]: For 437904/437904 co-relation queries the response was YES. [2022-12-13 13:13:36,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110141 conditions, 8835 events. 4581/8835 cut-off events. For 437904/437904 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 74730 event pairs, 183 based on Foata normal form. 220/9055 useless extension candidates. Maximal degree in co-relation 108288. Up to 2285 conditions per place. [2022-12-13 13:13:36,988 INFO L137 encePairwiseOnDemand]: 12/44 looper letters, 270 selfloop transitions, 1212 changer transitions 5/1487 dead transitions. [2022-12-13 13:13:36,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 1487 transitions, 54338 flow [2022-12-13 13:13:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:13:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:13:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2022-12-13 13:13:36,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-13 13:13:36,990 INFO L175 Difference]: Start difference. First operand has 342 places, 1297 transitions, 46772 flow. Second operand 16 states and 132 transitions. [2022-12-13 13:13:36,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 1487 transitions, 54338 flow [2022-12-13 13:13:40,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1487 transitions, 53361 flow, removed 149 selfloop flow, removed 8 redundant places. [2022-12-13 13:13:40,278 INFO L231 Difference]: Finished difference. Result has 353 places, 1396 transitions, 53643 flow [2022-12-13 13:13:40,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=45509, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=53643, PETRI_PLACES=353, PETRI_TRANSITIONS=1396} [2022-12-13 13:13:40,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 333 predicate places. [2022-12-13 13:13:40,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:40,279 INFO L89 Accepts]: Start accepts. Operand has 353 places, 1396 transitions, 53643 flow [2022-12-13 13:13:40,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:40,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:40,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 1396 transitions, 53643 flow [2022-12-13 13:13:40,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 1396 transitions, 53643 flow [2022-12-13 13:13:41,247 INFO L130 PetriNetUnfolder]: 998/3522 cut-off events. [2022-12-13 13:13:41,247 INFO L131 PetriNetUnfolder]: For 142373/142430 co-relation queries the response was YES. [2022-12-13 13:13:41,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39873 conditions, 3522 events. 998/3522 cut-off events. For 142373/142430 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 39825 event pairs, 7 based on Foata normal form. 2/3523 useless extension candidates. Maximal degree in co-relation 39196. Up to 882 conditions per place. [2022-12-13 13:13:41,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 1396 transitions, 53643 flow [2022-12-13 13:13:41,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 5058 [2022-12-13 13:13:41,317 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:13:41,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1039 [2022-12-13 13:13:41,318 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 1396 transitions, 53643 flow [2022-12-13 13:13:41,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:41,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:41,318 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:41,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-13 13:13:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 13:13:41,518 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1611584767, now seen corresponding path program 1 times [2022-12-13 13:13:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835438141] [2022-12-13 13:13:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:41,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835438141] [2022-12-13 13:13:41,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835438141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:41,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359612182] [2022-12-13 13:13:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:41,586 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:41,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 13:13:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:41,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 13:13:41,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:41,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:41,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359612182] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:41,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:41,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 6 [2022-12-13 13:13:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859194881] [2022-12-13 13:13:41,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:13:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:41,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:13:41,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:13:41,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 13:13:41,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 1396 transitions, 53643 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:41,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:41,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 13:13:41,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:48,388 INFO L130 PetriNetUnfolder]: 6160/11790 cut-off events. [2022-12-13 13:13:48,389 INFO L131 PetriNetUnfolder]: For 630971/630971 co-relation queries the response was YES. [2022-12-13 13:13:48,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152921 conditions, 11790 events. 6160/11790 cut-off events. For 630971/630971 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 103459 event pairs, 345 based on Foata normal form. 12/11802 useless extension candidates. Maximal degree in co-relation 148726. Up to 5301 conditions per place. [2022-12-13 13:13:48,532 INFO L137 encePairwiseOnDemand]: 14/44 looper letters, 1021 selfloop transitions, 926 changer transitions 70/2017 dead transitions. [2022-12-13 13:13:48,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 2017 transitions, 76927 flow [2022-12-13 13:13:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:13:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:13:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-12-13 13:13:48,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2022-12-13 13:13:48,533 INFO L175 Difference]: Start difference. First operand has 353 places, 1396 transitions, 53643 flow. Second operand 7 states and 100 transitions. [2022-12-13 13:13:48,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 2017 transitions, 76927 flow [2022-12-13 13:13:54,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 2017 transitions, 75584 flow, removed 592 selfloop flow, removed 5 redundant places. [2022-12-13 13:13:54,133 INFO L231 Difference]: Finished difference. Result has 359 places, 1794 transitions, 71219 flow [2022-12-13 13:13:54,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=52636, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=71219, PETRI_PLACES=359, PETRI_TRANSITIONS=1794} [2022-12-13 13:13:54,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 339 predicate places. [2022-12-13 13:13:54,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:13:54,134 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1794 transitions, 71219 flow [2022-12-13 13:13:54,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:13:54,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:13:54,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1794 transitions, 71219 flow [2022-12-13 13:13:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 1794 transitions, 71219 flow [2022-12-13 13:13:55,560 INFO L130 PetriNetUnfolder]: 1323/4597 cut-off events. [2022-12-13 13:13:55,560 INFO L131 PetriNetUnfolder]: For 188413/188478 co-relation queries the response was YES. [2022-12-13 13:13:55,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53721 conditions, 4597 events. 1323/4597 cut-off events. For 188413/188478 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 54169 event pairs, 10 based on Foata normal form. 2/4598 useless extension candidates. Maximal degree in co-relation 52479. Up to 1214 conditions per place. [2022-12-13 13:13:55,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1794 transitions, 71219 flow [2022-12-13 13:13:55,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 6662 [2022-12-13 13:13:55,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] $Ultimate##0-->L41-4: Formula: (and (= 5 v_thread1Thread1of1ForFork0_~i~0_257) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_256| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_332| 1) (= (ite (< 2 v_~counter~0_539) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256|) (= v_~counter~0_539 (+ v_~counter~0_541 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_256|) (< 4 v_~N~0_163)) InVars {~counter~0=v_~counter~0_541, ~N~0=v_~N~0_163} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_256|, ~counter~0=v_~counter~0_539, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_256|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_219|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_213|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_257, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_260|, ~N~0=v_~N~0_163, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_332|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:13:55,658 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:55,658 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:55,746 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:13:55,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1613 [2022-12-13 13:13:55,747 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 1794 transitions, 71260 flow [2022-12-13 13:13:55,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:55,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:55,747 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:55,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 13:13:55,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 13:13:55,948 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:13:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash 148156060, now seen corresponding path program 1 times [2022-12-13 13:13:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:55,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784369146] [2022-12-13 13:13:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:55,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784369146] [2022-12-13 13:13:55,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784369146] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:55,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734248416] [2022-12-13 13:13:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:55,996 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:55,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 13:13:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:56,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:13:56,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:56,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734248416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:56,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:56,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:13:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840018767] [2022-12-13 13:13:56,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:56,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:13:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:13:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:13:56,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 13:13:56,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1794 transitions, 71260 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-13 13:13:56,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:56,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 13:13:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:05,635 INFO L130 PetriNetUnfolder]: 7239/13806 cut-off events. [2022-12-13 13:14:05,635 INFO L131 PetriNetUnfolder]: For 797972/797972 co-relation queries the response was YES. [2022-12-13 13:14:05,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186347 conditions, 13806 events. 7239/13806 cut-off events. For 797972/797972 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 123852 event pairs, 850 based on Foata normal form. 100/13906 useless extension candidates. Maximal degree in co-relation 184487. Up to 5784 conditions per place. [2022-12-13 13:14:05,813 INFO L137 encePairwiseOnDemand]: 11/43 looper letters, 707 selfloop transitions, 1548 changer transitions 15/2270 dead transitions. [2022-12-13 13:14:05,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 2270 transitions, 92160 flow [2022-12-13 13:14:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:14:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:14:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 109 transitions. [2022-12-13 13:14:05,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19499105545617174 [2022-12-13 13:14:05,814 INFO L175 Difference]: Start difference. First operand has 357 places, 1794 transitions, 71260 flow. Second operand 13 states and 109 transitions. [2022-12-13 13:14:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 2270 transitions, 92160 flow [2022-12-13 13:14:13,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 2270 transitions, 89079 flow, removed 1508 selfloop flow, removed 3 redundant places. [2022-12-13 13:14:13,340 INFO L231 Difference]: Finished difference. Result has 373 places, 2165 transitions, 88372 flow [2022-12-13 13:14:13,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=69163, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=88372, PETRI_PLACES=373, PETRI_TRANSITIONS=2165} [2022-12-13 13:14:13,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 353 predicate places. [2022-12-13 13:14:13,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:14:13,341 INFO L89 Accepts]: Start accepts. Operand has 373 places, 2165 transitions, 88372 flow [2022-12-13 13:14:13,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:14:13,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:14:13,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 2165 transitions, 88372 flow [2022-12-13 13:14:13,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 2165 transitions, 88372 flow [2022-12-13 13:14:15,659 INFO L130 PetriNetUnfolder]: 1568/5414 cut-off events. [2022-12-13 13:14:15,660 INFO L131 PetriNetUnfolder]: For 237703/237768 co-relation queries the response was YES. [2022-12-13 13:14:15,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65549 conditions, 5414 events. 1568/5414 cut-off events. For 237703/237768 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 65559 event pairs, 10 based on Foata normal form. 2/5415 useless extension candidates. Maximal degree in co-relation 64148. Up to 1292 conditions per place. [2022-12-13 13:14:15,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 2165 transitions, 88372 flow [2022-12-13 13:14:15,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 8076 [2022-12-13 13:14:15,760 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:14:15,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2420 [2022-12-13 13:14:15,761 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 2165 transitions, 88372 flow [2022-12-13 13:14:15,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-13 13:14:15,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:15,761 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:15,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 13:14:15,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 13:14:15,966 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:14:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash -399854335, now seen corresponding path program 1 times [2022-12-13 13:14:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:15,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742617496] [2022-12-13 13:14:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:16,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742617496] [2022-12-13 13:14:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742617496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:14:16,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886173673] [2022-12-13 13:14:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:16,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:14:16,021 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:14:16,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 13:14:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:16,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:14:16,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:14:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:16,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:14:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:16,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886173673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:14:16,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:14:16,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 13:14:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203657158] [2022-12-13 13:14:16,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:14:16,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:14:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:14:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:14:16,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 13:14:16,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 2165 transitions, 88372 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:16,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:16,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 13:14:16,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:27,972 INFO L130 PetriNetUnfolder]: 7614/14499 cut-off events. [2022-12-13 13:14:27,972 INFO L131 PetriNetUnfolder]: For 929149/929149 co-relation queries the response was YES. [2022-12-13 13:14:28,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201524 conditions, 14499 events. 7614/14499 cut-off events. For 929149/929149 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 131378 event pairs, 1421 based on Foata normal form. 4/14503 useless extension candidates. Maximal degree in co-relation 196843. Up to 9831 conditions per place. [2022-12-13 13:14:28,165 INFO L137 encePairwiseOnDemand]: 15/43 looper letters, 1561 selfloop transitions, 953 changer transitions 0/2514 dead transitions. [2022-12-13 13:14:28,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 2514 transitions, 102642 flow [2022-12-13 13:14:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:14:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:14:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 129 transitions. [2022-12-13 13:14:28,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17647058823529413 [2022-12-13 13:14:28,166 INFO L175 Difference]: Start difference. First operand has 373 places, 2165 transitions, 88372 flow. Second operand 17 states and 129 transitions. [2022-12-13 13:14:28,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 2514 transitions, 102642 flow [2022-12-13 13:14:36,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 2514 transitions, 101459 flow, removed 585 selfloop flow, removed 1 redundant places. [2022-12-13 13:14:36,993 INFO L231 Difference]: Finished difference. Result has 391 places, 2270 transitions, 94521 flow [2022-12-13 13:14:36,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=87339, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=856, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=94521, PETRI_PLACES=391, PETRI_TRANSITIONS=2270} [2022-12-13 13:14:36,995 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 371 predicate places. [2022-12-13 13:14:36,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:14:36,995 INFO L89 Accepts]: Start accepts. Operand has 391 places, 2270 transitions, 94521 flow [2022-12-13 13:14:37,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:14:37,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:14:37,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 391 places, 2270 transitions, 94521 flow [2022-12-13 13:14:37,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 2270 transitions, 94521 flow [2022-12-13 13:14:39,276 INFO L130 PetriNetUnfolder]: 1646/5695 cut-off events. [2022-12-13 13:14:39,276 INFO L131 PetriNetUnfolder]: For 261733/261798 co-relation queries the response was YES. [2022-12-13 13:14:39,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69807 conditions, 5695 events. 1646/5695 cut-off events. For 261733/261798 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 69587 event pairs, 10 based on Foata normal form. 2/5696 useless extension candidates. Maximal degree in co-relation 68370. Up to 1382 conditions per place. [2022-12-13 13:14:39,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 391 places, 2270 transitions, 94521 flow [2022-12-13 13:14:39,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 8550 [2022-12-13 13:14:39,540 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:14:39,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2546 [2022-12-13 13:14:39,541 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 2270 transitions, 94647 flow [2022-12-13 13:14:39,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:39,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:39,541 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:39,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-13 13:14:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-13 13:14:39,742 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:14:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1934894665, now seen corresponding path program 1 times [2022-12-13 13:14:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:39,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549987561] [2022-12-13 13:14:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549987561] [2022-12-13 13:14:39,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549987561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:14:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924388259] [2022-12-13 13:14:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:14:39,784 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:14:39,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 13:14:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:39,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:14:39,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:14:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:39,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:14:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:39,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924388259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:14:39,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:14:39,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 13:14:39,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532423581] [2022-12-13 13:14:39,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:14:39,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:14:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:14:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:14:39,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 13:14:39,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 2270 transitions, 94647 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:39,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:39,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 13:14:39,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:53,267 INFO L130 PetriNetUnfolder]: 8111/15428 cut-off events. [2022-12-13 13:14:53,267 INFO L131 PetriNetUnfolder]: For 1042884/1042884 co-relation queries the response was YES. [2022-12-13 13:14:53,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217790 conditions, 15428 events. 8111/15428 cut-off events. For 1042884/1042884 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 140721 event pairs, 1329 based on Foata normal form. 164/15592 useless extension candidates. Maximal degree in co-relation 212917. Up to 9157 conditions per place. [2022-12-13 13:14:53,469 INFO L137 encePairwiseOnDemand]: 14/45 looper letters, 1491 selfloop transitions, 1183 changer transitions 36/2710 dead transitions. [2022-12-13 13:14:53,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 2710 transitions, 111619 flow [2022-12-13 13:14:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:14:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 13:14:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 162 transitions. [2022-12-13 13:14:53,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-13 13:14:53,470 INFO L175 Difference]: Start difference. First operand has 391 places, 2270 transitions, 94647 flow. Second operand 22 states and 162 transitions. [2022-12-13 13:14:53,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 2710 transitions, 111619 flow [2022-12-13 13:15:03,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 2710 transitions, 111117 flow, removed 228 selfloop flow, removed 6 redundant places. [2022-12-13 13:15:03,292 INFO L231 Difference]: Finished difference. Result has 413 places, 2386 transitions, 102136 flow [2022-12-13 13:15:03,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94161, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=102136, PETRI_PLACES=413, PETRI_TRANSITIONS=2386} [2022-12-13 13:15:03,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 393 predicate places. [2022-12-13 13:15:03,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:15:03,294 INFO L89 Accepts]: Start accepts. Operand has 413 places, 2386 transitions, 102136 flow [2022-12-13 13:15:03,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:15:03,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:15:03,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 413 places, 2386 transitions, 102136 flow [2022-12-13 13:15:03,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 2386 transitions, 102136 flow [2022-12-13 13:15:05,700 INFO L130 PetriNetUnfolder]: 1737/6006 cut-off events. [2022-12-13 13:15:05,700 INFO L131 PetriNetUnfolder]: For 295071/295136 co-relation queries the response was YES. [2022-12-13 13:15:05,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75423 conditions, 6006 events. 1737/6006 cut-off events. For 295071/295136 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 74122 event pairs, 10 based on Foata normal form. 2/6006 useless extension candidates. Maximal degree in co-relation 73909. Up to 1486 conditions per place. [2022-12-13 13:15:05,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 413 places, 2386 transitions, 102136 flow [2022-12-13 13:15:05,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 8970 [2022-12-13 13:15:05,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| (ite (< 0 (+ v_~counter~0_595 1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|) (= v_~counter~0_595 (+ v_~counter~0_597 3)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_373|) (not (= (ite (< 1 v_~counter~0_595) 1 0) 0)) (= 5 v_thread1Thread1of1ForFork0_~i~0_278) (< 4 v_~N~0_169)) InVars {~counter~0=v_~counter~0_597, ~N~0=v_~N~0_169} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|, ~counter~0=v_~counter~0_595, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_290|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_240|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_234|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_278, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_294|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_373|, ~N~0=v_~N~0_169} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:15:06,010 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:15:06,010 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:15:06,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:15:06,145 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:15:06,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2851 [2022-12-13 13:15:06,145 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 2385 transitions, 102236 flow [2022-12-13 13:15:06,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:06,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:06,146 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:06,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-13 13:15:06,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:06,350 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:15:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1444899217, now seen corresponding path program 1 times [2022-12-13 13:15:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:06,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396832388] [2022-12-13 13:15:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396832388] [2022-12-13 13:15:06,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396832388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210116654] [2022-12-13 13:15:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:15:06,393 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:06,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 13:15:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:06,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:15:06,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:06,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:06,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210116654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:06,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:06,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 13:15:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043878117] [2022-12-13 13:15:06,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:06,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:15:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:06,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:15:06,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:15:06,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 13:15:06,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 2385 transitions, 102236 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-13 13:15:06,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:06,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 13:15:06,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:19,797 INFO L130 PetriNetUnfolder]: 8094/15407 cut-off events. [2022-12-13 13:15:19,797 INFO L131 PetriNetUnfolder]: For 1117566/1117566 co-relation queries the response was YES. [2022-12-13 13:15:19,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223677 conditions, 15407 events. 8094/15407 cut-off events. For 1117566/1117566 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 140701 event pairs, 1602 based on Foata normal form. 34/15439 useless extension candidates. Maximal degree in co-relation 218523. Up to 11028 conditions per place. [2022-12-13 13:15:20,013 INFO L137 encePairwiseOnDemand]: 16/48 looper letters, 1740 selfloop transitions, 902 changer transitions 1/2643 dead transitions. [2022-12-13 13:15:20,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 2643 transitions, 113462 flow [2022-12-13 13:15:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:15:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:15:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2022-12-13 13:15:20,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1800595238095238 [2022-12-13 13:15:20,014 INFO L175 Difference]: Start difference. First operand has 412 places, 2385 transitions, 102236 flow. Second operand 14 states and 121 transitions. [2022-12-13 13:15:20,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 2643 transitions, 113462 flow [2022-12-13 13:15:30,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 2643 transitions, 112051 flow, removed 591 selfloop flow, removed 3 redundant places. [2022-12-13 13:15:30,609 INFO L231 Difference]: Finished difference. Result has 423 places, 2408 transitions, 103889 flow [2022-12-13 13:15:30,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=100825, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=878, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=103889, PETRI_PLACES=423, PETRI_TRANSITIONS=2408} [2022-12-13 13:15:30,610 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 403 predicate places. [2022-12-13 13:15:30,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:15:30,611 INFO L89 Accepts]: Start accepts. Operand has 423 places, 2408 transitions, 103889 flow [2022-12-13 13:15:30,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:15:30,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:15:30,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 423 places, 2408 transitions, 103889 flow [2022-12-13 13:15:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 422 places, 2408 transitions, 103889 flow [2022-12-13 13:15:33,261 INFO L130 PetriNetUnfolder]: 1755/6041 cut-off events. [2022-12-13 13:15:33,262 INFO L131 PetriNetUnfolder]: For 306198/306265 co-relation queries the response was YES. [2022-12-13 13:15:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76556 conditions, 6041 events. 1755/6041 cut-off events. For 306198/306265 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 74442 event pairs, 11 based on Foata normal form. 2/6041 useless extension candidates. Maximal degree in co-relation 74953. Up to 1500 conditions per place. [2022-12-13 13:15:33,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 422 places, 2408 transitions, 103889 flow [2022-12-13 13:15:33,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 9074 [2022-12-13 13:15:33,396 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:15:33,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2785 [2022-12-13 13:15:33,396 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 2408 transitions, 103889 flow [2022-12-13 13:15:33,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-13 13:15:33,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:33,396 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:33,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-13 13:15:33,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:33,599 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:15:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 234421136, now seen corresponding path program 1 times [2022-12-13 13:15:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:33,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524379842] [2022-12-13 13:15:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524379842] [2022-12-13 13:15:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524379842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142628997] [2022-12-13 13:15:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:33,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:15:33,635 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:33,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 13:15:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:33,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:15:33,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:33,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142628997] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:33,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:33,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:15:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574474198] [2022-12-13 13:15:33,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:15:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:15:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:15:33,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 13:15:33,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 2408 transitions, 103889 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:33,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:33,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 13:15:33,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:48,732 INFO L130 PetriNetUnfolder]: 8793/16837 cut-off events. [2022-12-13 13:15:48,732 INFO L131 PetriNetUnfolder]: For 1164066/1164066 co-relation queries the response was YES. [2022-12-13 13:15:48,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243773 conditions, 16837 events. 8793/16837 cut-off events. For 1164066/1164066 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 155787 event pairs, 207 based on Foata normal form. 64/16899 useless extension candidates. Maximal degree in co-relation 237001. Up to 5085 conditions per place. [2022-12-13 13:15:48,973 INFO L137 encePairwiseOnDemand]: 11/47 looper letters, 406 selfloop transitions, 2382 changer transitions 2/2790 dead transitions. [2022-12-13 13:15:48,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 2790 transitions, 120508 flow [2022-12-13 13:15:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 13:15:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 13:15:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 173 transitions. [2022-12-13 13:15:48,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15336879432624115 [2022-12-13 13:15:48,974 INFO L175 Difference]: Start difference. First operand has 422 places, 2408 transitions, 103889 flow. Second operand 24 states and 173 transitions. [2022-12-13 13:15:48,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 2790 transitions, 120508 flow [2022-12-13 13:16:02,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 2790 transitions, 119516 flow, removed 156 selfloop flow, removed 6 redundant places. [2022-12-13 13:16:02,612 INFO L231 Difference]: Finished difference. Result has 451 places, 2665 transitions, 121017 flow [2022-12-13 13:16:02,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102917, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=121017, PETRI_PLACES=451, PETRI_TRANSITIONS=2665} [2022-12-13 13:16:02,614 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 431 predicate places. [2022-12-13 13:16:02,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:02,614 INFO L89 Accepts]: Start accepts. Operand has 451 places, 2665 transitions, 121017 flow [2022-12-13 13:16:02,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:02,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:02,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 451 places, 2665 transitions, 121017 flow [2022-12-13 13:16:02,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 451 places, 2665 transitions, 121017 flow [2022-12-13 13:16:05,861 INFO L130 PetriNetUnfolder]: 1881/6524 cut-off events. [2022-12-13 13:16:05,861 INFO L131 PetriNetUnfolder]: For 378443/378510 co-relation queries the response was YES. [2022-12-13 13:16:05,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88588 conditions, 6524 events. 1881/6524 cut-off events. For 378443/378510 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 81626 event pairs, 8 based on Foata normal form. 2/6523 useless extension candidates. Maximal degree in co-relation 86446. Up to 1628 conditions per place. [2022-12-13 13:16:06,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 2665 transitions, 121017 flow [2022-12-13 13:16:06,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 9908 [2022-12-13 13:16:06,034 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:16:06,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3421 [2022-12-13 13:16:06,035 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 2665 transitions, 121017 flow [2022-12-13 13:16:06,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:06,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:06,035 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:06,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-13 13:16:06,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 13:16:06,239 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:16:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1495843032, now seen corresponding path program 2 times [2022-12-13 13:16:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:06,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545141901] [2022-12-13 13:16:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545141901] [2022-12-13 13:16:06,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545141901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476569034] [2022-12-13 13:16:06,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:16:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:16:06,269 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:06,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 13:16:06,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:16:06,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:16:06,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:16:06,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:06,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:16:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:06,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476569034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:16:06,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:16:06,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:16:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598687284] [2022-12-13 13:16:06,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:16:06,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:16:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:16:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:16:06,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 13:16:06,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 2665 transitions, 121017 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:06,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:06,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 13:16:06,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:26,786 INFO L130 PetriNetUnfolder]: 9219/17569 cut-off events. [2022-12-13 13:16:26,786 INFO L131 PetriNetUnfolder]: For 1517669/1517669 co-relation queries the response was YES. [2022-12-13 13:16:26,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270883 conditions, 17569 events. 9219/17569 cut-off events. For 1517669/1517669 co-relation queries the response was YES. Maximal size of possible extension queue 1421. Compared 163437 event pairs, 1722 based on Foata normal form. 134/17701 useless extension candidates. Maximal degree in co-relation 263639. Up to 11797 conditions per place. [2022-12-13 13:16:27,048 INFO L137 encePairwiseOnDemand]: 14/47 looper letters, 1713 selfloop transitions, 1234 changer transitions 21/2968 dead transitions. [2022-12-13 13:16:27,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 2968 transitions, 136707 flow [2022-12-13 13:16:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:16:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:16:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 123 transitions. [2022-12-13 13:16:27,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17446808510638298 [2022-12-13 13:16:27,049 INFO L175 Difference]: Start difference. First operand has 451 places, 2665 transitions, 121017 flow. Second operand 15 states and 123 transitions. [2022-12-13 13:16:27,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 2968 transitions, 136707 flow [2022-12-13 13:16:49,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 2968 transitions, 133653 flow, removed 1466 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:50,056 INFO L231 Difference]: Finished difference. Result has 468 places, 2782 transitions, 127555 flow [2022-12-13 13:16:50,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=118036, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=127555, PETRI_PLACES=468, PETRI_TRANSITIONS=2782} [2022-12-13 13:16:50,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 448 predicate places. [2022-12-13 13:16:50,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:50,058 INFO L89 Accepts]: Start accepts. Operand has 468 places, 2782 transitions, 127555 flow [2022-12-13 13:16:50,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:50,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:50,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 468 places, 2782 transitions, 127555 flow [2022-12-13 13:16:50,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 467 places, 2782 transitions, 127555 flow [2022-12-13 13:16:53,611 INFO L130 PetriNetUnfolder]: 1979/6791 cut-off events. [2022-12-13 13:16:53,611 INFO L131 PetriNetUnfolder]: For 399742/399808 co-relation queries the response was YES. [2022-12-13 13:16:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92751 conditions, 6791 events. 1979/6791 cut-off events. For 399742/399808 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 85024 event pairs, 8 based on Foata normal form. 2/6790 useless extension candidates. Maximal degree in co-relation 90756. Up to 1747 conditions per place. [2022-12-13 13:16:53,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 467 places, 2782 transitions, 127555 flow [2022-12-13 13:16:53,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 10394 [2022-12-13 13:16:53,781 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:16:53,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3724 [2022-12-13 13:16:53,782 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 2782 transitions, 127555 flow [2022-12-13 13:16:53,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:53,782 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:53,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:53,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:53,984 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:16:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1753716746, now seen corresponding path program 3 times [2022-12-13 13:16:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:53,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264490725] [2022-12-13 13:16:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:54,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264490725] [2022-12-13 13:16:54,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264490725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:54,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47865404] [2022-12-13 13:16:54,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:16:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:16:54,013 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 13:16:54,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:16:54,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:16:54,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:16:54,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:54,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:16:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:54,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47865404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:16:54,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:16:54,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:16:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805718561] [2022-12-13 13:16:54,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:16:54,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:16:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:16:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:16:54,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 13:16:54,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 2782 transitions, 127555 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-13 13:16:54,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:54,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 13:16:54,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:17:14,049 INFO L130 PetriNetUnfolder]: 9157/17413 cut-off events. [2022-12-13 13:17:14,050 INFO L131 PetriNetUnfolder]: For 1424676/1424676 co-relation queries the response was YES. [2022-12-13 13:17:14,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271989 conditions, 17413 events. 9157/17413 cut-off events. For 1424676/1424676 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 160878 event pairs, 350 based on Foata normal form. 112/17523 useless extension candidates. Maximal degree in co-relation 264593. Up to 5497 conditions per place. [2022-12-13 13:17:14,310 INFO L137 encePairwiseOnDemand]: 12/47 looper letters, 440 selfloop transitions, 2441 changer transitions 5/2886 dead transitions. [2022-12-13 13:17:14,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 2886 transitions, 135674 flow [2022-12-13 13:17:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:17:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:17:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2022-12-13 13:17:14,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18581560283687942 [2022-12-13 13:17:14,311 INFO L175 Difference]: Start difference. First operand has 467 places, 2782 transitions, 127555 flow. Second operand 15 states and 131 transitions. [2022-12-13 13:17:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 2886 transitions, 135674 flow [2022-12-13 13:17:37,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 2886 transitions, 133820 flow, removed 295 selfloop flow, removed 7 redundant places. [2022-12-13 13:17:38,096 INFO L231 Difference]: Finished difference. Result has 475 places, 2789 transitions, 133267 flow [2022-12-13 13:17:38,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=125548, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2424, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=133267, PETRI_PLACES=475, PETRI_TRANSITIONS=2789} [2022-12-13 13:17:38,098 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 455 predicate places. [2022-12-13 13:17:38,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:17:38,098 INFO L89 Accepts]: Start accepts. Operand has 475 places, 2789 transitions, 133267 flow [2022-12-13 13:17:38,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:17:38,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:17:38,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 2789 transitions, 133267 flow [2022-12-13 13:17:38,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 2789 transitions, 133267 flow [2022-12-13 13:17:41,728 INFO L130 PetriNetUnfolder]: 1973/6756 cut-off events. [2022-12-13 13:17:41,728 INFO L131 PetriNetUnfolder]: For 425588/425654 co-relation queries the response was YES. [2022-12-13 13:17:41,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94859 conditions, 6756 events. 1973/6756 cut-off events. For 425588/425654 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 84508 event pairs, 8 based on Foata normal form. 2/6756 useless extension candidates. Maximal degree in co-relation 92709. Up to 1759 conditions per place. [2022-12-13 13:17:41,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 2789 transitions, 133267 flow [2022-12-13 13:17:41,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 10428 [2022-12-13 13:17:41,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:17:41,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3814 [2022-12-13 13:17:41,912 INFO L495 AbstractCegarLoop]: Abstraction has has 475 places, 2789 transitions, 133267 flow [2022-12-13 13:17:41,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-13 13:17:41,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:17:41,913 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:17:41,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-13 13:17:42,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-13 13:17:42,113 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:17:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2143080157, now seen corresponding path program 1 times [2022-12-13 13:17:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:42,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967211551] [2022-12-13 13:17:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:17:42,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967211551] [2022-12-13 13:17:42,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967211551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:17:42,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453936074] [2022-12-13 13:17:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:42,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:17:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:17:42,148 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:17:42,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 13:17:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:42,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:17:42,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:42,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:17:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:42,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453936074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:17:42,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:17:42,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 13:17:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122375574] [2022-12-13 13:17:42,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:17:42,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:17:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:17:42,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:17:42,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:17:42,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 13:17:42,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 2789 transitions, 133267 flow. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:17:42,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:17:42,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 13:17:42,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:18:05,971 INFO L130 PetriNetUnfolder]: 10327/19748 cut-off events. [2022-12-13 13:18:05,971 INFO L131 PetriNetUnfolder]: For 1725808/1725808 co-relation queries the response was YES. [2022-12-13 13:18:06,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311110 conditions, 19748 events. 10327/19748 cut-off events. For 1725808/1725808 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 186743 event pairs, 215 based on Foata normal form. 52/19798 useless extension candidates. Maximal degree in co-relation 302353. Up to 6279 conditions per place. [2022-12-13 13:18:06,298 INFO L137 encePairwiseOnDemand]: 11/47 looper letters, 303 selfloop transitions, 3015 changer transitions 39/3357 dead transitions. [2022-12-13 13:18:06,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 3357 transitions, 157848 flow [2022-12-13 13:18:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 13:18:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 13:18:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 227 transitions. [2022-12-13 13:18:06,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13799392097264437 [2022-12-13 13:18:06,300 INFO L175 Difference]: Start difference. First operand has 475 places, 2789 transitions, 133267 flow. Second operand 35 states and 227 transitions. [2022-12-13 13:18:06,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 3357 transitions, 157848 flow [2022-12-13 13:18:35,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 3357 transitions, 155601 flow, removed 326 selfloop flow, removed 5 redundant places. [2022-12-13 13:18:35,246 INFO L231 Difference]: Finished difference. Result has 516 places, 3173 transitions, 156113 flow [2022-12-13 13:18:35,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=131172, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2663, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=156113, PETRI_PLACES=516, PETRI_TRANSITIONS=3173} [2022-12-13 13:18:35,248 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 496 predicate places. [2022-12-13 13:18:35,248 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:18:35,248 INFO L89 Accepts]: Start accepts. Operand has 516 places, 3173 transitions, 156113 flow [2022-12-13 13:18:35,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:18:35,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:18:35,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 3173 transitions, 156113 flow [2022-12-13 13:18:35,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 515 places, 3173 transitions, 156113 flow [2022-12-13 13:18:39,553 INFO L130 PetriNetUnfolder]: 2194/7477 cut-off events. [2022-12-13 13:18:39,553 INFO L131 PetriNetUnfolder]: For 497415/497481 co-relation queries the response was YES. [2022-12-13 13:18:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110893 conditions, 7477 events. 2194/7477 cut-off events. For 497415/497481 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 94524 event pairs, 4 based on Foata normal form. 2/7471 useless extension candidates. Maximal degree in co-relation 108744. Up to 2009 conditions per place. [2022-12-13 13:18:39,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 515 places, 3173 transitions, 156113 flow [2022-12-13 13:18:39,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 11788 [2022-12-13 13:18:39,736 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:18:39,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4489 [2022-12-13 13:18:39,737 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 3173 transitions, 156113 flow [2022-12-13 13:18:39,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:18:39,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:18:39,737 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:18:39,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-13 13:18:39,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:18:39,942 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:18:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:18:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1448919552, now seen corresponding path program 1 times [2022-12-13 13:18:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:18:39,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995072467] [2022-12-13 13:18:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:18:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:18:39,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:18:39,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995072467] [2022-12-13 13:18:39,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995072467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:18:39,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897391177] [2022-12-13 13:18:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:39,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:18:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:18:39,992 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:18:39,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 13:18:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:40,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:18:40,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:18:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:18:40,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:18:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:18:40,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897391177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:18:40,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:18:40,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 13:18:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767961470] [2022-12-13 13:18:40,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:18:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:18:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:18:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:18:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:18:40,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 13:18:40,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 3173 transitions, 156113 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-13 13:18:40,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:18:40,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 13:18:40,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:19:06,234 INFO L130 PetriNetUnfolder]: 10634/20178 cut-off events. [2022-12-13 13:19:06,234 INFO L131 PetriNetUnfolder]: For 2082223/2082223 co-relation queries the response was YES. [2022-12-13 13:19:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338336 conditions, 20178 events. 10634/20178 cut-off events. For 2082223/2082223 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 190003 event pairs, 2111 based on Foata normal form. 168/20344 useless extension candidates. Maximal degree in co-relation 332535. Up to 13234 conditions per place. [2022-12-13 13:19:06,611 INFO L137 encePairwiseOnDemand]: 16/47 looper letters, 2310 selfloop transitions, 1289 changer transitions 1/3600 dead transitions. [2022-12-13 13:19:06,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 3600 transitions, 177266 flow [2022-12-13 13:19:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:19:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:19:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2022-12-13 13:19:06,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17271589486858574 [2022-12-13 13:19:06,612 INFO L175 Difference]: Start difference. First operand has 515 places, 3173 transitions, 156113 flow. Second operand 17 states and 138 transitions. [2022-12-13 13:19:06,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 3600 transitions, 177266 flow [2022-12-13 13:19:53,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 3600 transitions, 167629 flow, removed 4178 selfloop flow, removed 5 redundant places. [2022-12-13 13:19:54,016 INFO L231 Difference]: Finished difference. Result has 528 places, 3276 transitions, 156864 flow [2022-12-13 13:19:54,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=147794, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=156864, PETRI_PLACES=528, PETRI_TRANSITIONS=3276} [2022-12-13 13:19:54,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 508 predicate places. [2022-12-13 13:19:54,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:19:54,019 INFO L89 Accepts]: Start accepts. Operand has 528 places, 3276 transitions, 156864 flow [2022-12-13 13:19:54,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:19:54,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:19:54,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 528 places, 3276 transitions, 156864 flow [2022-12-13 13:19:54,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 528 places, 3276 transitions, 156864 flow [2022-12-13 13:19:58,842 INFO L130 PetriNetUnfolder]: 2274/7750 cut-off events. [2022-12-13 13:19:58,843 INFO L131 PetriNetUnfolder]: For 489820/489886 co-relation queries the response was YES. [2022-12-13 13:19:58,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111372 conditions, 7750 events. 2274/7750 cut-off events. For 489820/489886 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 98357 event pairs, 4 based on Foata normal form. 2/7744 useless extension candidates. Maximal degree in co-relation 109180. Up to 1998 conditions per place. [2022-12-13 13:19:59,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 528 places, 3276 transitions, 156864 flow [2022-12-13 13:19:59,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 12246 [2022-12-13 13:19:59,068 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:19:59,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5049 [2022-12-13 13:19:59,068 INFO L495 AbstractCegarLoop]: Abstraction has has 528 places, 3276 transitions, 156864 flow [2022-12-13 13:19:59,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-13 13:19:59,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:19:59,069 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:59,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-13 13:19:59,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:59,274 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:19:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1060474652, now seen corresponding path program 2 times [2022-12-13 13:19:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:59,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410191712] [2022-12-13 13:19:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:59,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410191712] [2022-12-13 13:19:59,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410191712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:59,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614966551] [2022-12-13 13:19:59,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:19:59,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:19:59,346 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:19:59,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 13:19:59,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:19:59,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:19:59,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 13:19:59,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:59,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:19:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614966551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:19:59,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:19:59,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 7 [2022-12-13 13:19:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046653411] [2022-12-13 13:19:59,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:19:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:19:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:19:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:19:59,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 13:19:59,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 3276 transitions, 156864 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:59,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:19:59,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 13:19:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:27,487 INFO L130 PetriNetUnfolder]: 11032/20917 cut-off events. [2022-12-13 13:20:27,487 INFO L131 PetriNetUnfolder]: For 1899099/1899099 co-relation queries the response was YES. [2022-12-13 13:20:27,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342856 conditions, 20917 events. 11032/20917 cut-off events. For 1899099/1899099 co-relation queries the response was YES. Maximal size of possible extension queue 1641. Compared 196887 event pairs, 952 based on Foata normal form. 5/20920 useless extension candidates. Maximal degree in co-relation 336630. Up to 15796 conditions per place. [2022-12-13 13:20:27,891 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 2682 selfloop transitions, 868 changer transitions 36/3586 dead transitions. [2022-12-13 13:20:27,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 3586 transitions, 175236 flow [2022-12-13 13:20:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:20:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:20:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 13:20:27,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27393617021276595 [2022-12-13 13:20:27,892 INFO L175 Difference]: Start difference. First operand has 528 places, 3276 transitions, 156864 flow. Second operand 8 states and 103 transitions. [2022-12-13 13:20:27,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 3586 transitions, 175236 flow [2022-12-13 13:21:11,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 3586 transitions, 173439 flow, removed 788 selfloop flow, removed 7 redundant places. [2022-12-13 13:21:12,054 INFO L231 Difference]: Finished difference. Result has 534 places, 3394 transitions, 165142 flow [2022-12-13 13:21:12,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=155132, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=751, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=165142, PETRI_PLACES=534, PETRI_TRANSITIONS=3394} [2022-12-13 13:21:12,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 514 predicate places. [2022-12-13 13:21:12,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:21:12,057 INFO L89 Accepts]: Start accepts. Operand has 534 places, 3394 transitions, 165142 flow [2022-12-13 13:21:12,097 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:21:12,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:21:12,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 534 places, 3394 transitions, 165142 flow [2022-12-13 13:21:12,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 534 places, 3394 transitions, 165142 flow [2022-12-13 13:21:16,978 INFO L130 PetriNetUnfolder]: 2355/8016 cut-off events. [2022-12-13 13:21:16,978 INFO L131 PetriNetUnfolder]: For 515366/515441 co-relation queries the response was YES. [2022-12-13 13:21:17,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117128 conditions, 8016 events. 2355/8016 cut-off events. For 515366/515441 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 102133 event pairs, 4 based on Foata normal form. 2/8011 useless extension candidates. Maximal degree in co-relation 114929. Up to 1861 conditions per place. [2022-12-13 13:21:17,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 534 places, 3394 transitions, 165142 flow [2022-12-13 13:21:17,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 12702 [2022-12-13 13:21:17,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308| 0)) (< v_thread1Thread1of1ForFork0_~i~0_296 (+ v_~N~0_175 1)) (= 6 v_thread1Thread1of1ForFork0_~i~0_296) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| (ite (< 0 (+ v_~counter~0_629 2)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_398| 1) (= v_~counter~0_627 (+ v_~counter~0_629 5)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|)) InVars {~counter~0=v_~counter~0_629, ~N~0=v_~N~0_175} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|, ~counter~0=v_~counter~0_627, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_308|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_257|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_251|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_296, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_312|, ~N~0=v_~N~0_175, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_398|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:21:17,181 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:21:17,181 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:21:17,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_616 (+ v_~counter~0_618 6)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| (ite (< 0 (+ v_~counter~0_618 5)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_389|) (< v_thread1Thread1of1ForFork0_~i~0_290 (+ v_~N~0_173 1)) (= 9 v_thread1Thread1of1ForFork0_~i~0_290) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|) (not (= (ite (< 0 (+ v_~counter~0_618 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_618, ~N~0=v_~N~0_173} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|, ~counter~0=v_~counter~0_616, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_302|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_251|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_245|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_290, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_306|, ~N~0=v_~N~0_173, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_389|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:21:17,268 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:21:17,268 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:21:17,373 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:21:17,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5317 [2022-12-13 13:21:17,374 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 3394 transitions, 165219 flow [2022-12-13 13:21:17,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:17,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:17,374 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:17,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-13 13:21:17,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 13:21:17,587 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:21:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash 647942867, now seen corresponding path program 2 times [2022-12-13 13:21:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:17,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670853939] [2022-12-13 13:21:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:17,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670853939] [2022-12-13 13:21:17,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670853939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:21:17,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725413423] [2022-12-13 13:21:17,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:21:17,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:21:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:21:17,627 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:21:17,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 13:21:17,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:21:17,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:21:17,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:21:17,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:21:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:17,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:21:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:17,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725413423] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:21:17,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:21:17,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 13:21:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378202659] [2022-12-13 13:21:17,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:21:17,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:21:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:21:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:21:17,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 13:21:17,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 3394 transitions, 165219 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:17,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:17,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 13:21:17,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:51,549 INFO L130 PetriNetUnfolder]: 12748/23992 cut-off events. [2022-12-13 13:21:51,550 INFO L131 PetriNetUnfolder]: For 2231765/2231765 co-relation queries the response was YES. [2022-12-13 13:21:51,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395276 conditions, 23992 events. 12748/23992 cut-off events. For 2231765/2231765 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 229066 event pairs, 1380 based on Foata normal form. 346/24338 useless extension candidates. Maximal degree in co-relation 388180. Up to 9901 conditions per place. [2022-12-13 13:21:52,039 INFO L137 encePairwiseOnDemand]: 14/49 looper letters, 1310 selfloop transitions, 2855 changer transitions 68/4233 dead transitions. [2022-12-13 13:21:52,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 4233 transitions, 205527 flow [2022-12-13 13:21:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 13:21:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 13:21:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 157 transitions. [2022-12-13 13:21:52,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16020408163265307 [2022-12-13 13:21:52,041 INFO L175 Difference]: Start difference. First operand has 534 places, 3394 transitions, 165219 flow. Second operand 20 states and 157 transitions. [2022-12-13 13:21:52,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 4233 transitions, 205527 flow [2022-12-13 13:22:47,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 4233 transitions, 204232 flow, removed 395 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:47,951 INFO L231 Difference]: Finished difference. Result has 562 places, 3961 transitions, 198603 flow [2022-12-13 13:22:47,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=164035, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=198603, PETRI_PLACES=562, PETRI_TRANSITIONS=3961} [2022-12-13 13:22:47,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 542 predicate places. [2022-12-13 13:22:47,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:47,954 INFO L89 Accepts]: Start accepts. Operand has 562 places, 3961 transitions, 198603 flow [2022-12-13 13:22:48,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:48,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:48,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 562 places, 3961 transitions, 198603 flow [2022-12-13 13:22:48,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 562 places, 3961 transitions, 198603 flow [2022-12-13 13:22:55,931 INFO L130 PetriNetUnfolder]: 2719/9164 cut-off events. [2022-12-13 13:22:55,931 INFO L131 PetriNetUnfolder]: For 631056/631131 co-relation queries the response was YES. [2022-12-13 13:22:56,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140141 conditions, 9164 events. 2719/9164 cut-off events. For 631056/631131 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 118911 event pairs, 5 based on Foata normal form. 2/9157 useless extension candidates. Maximal degree in co-relation 137935. Up to 2195 conditions per place. [2022-12-13 13:22:56,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 562 places, 3961 transitions, 198603 flow [2022-12-13 13:22:56,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 14720 [2022-12-13 13:22:56,484 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:22:56,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8530 [2022-12-13 13:22:56,484 INFO L495 AbstractCegarLoop]: Abstraction has has 562 places, 3961 transitions, 198603 flow [2022-12-13 13:22:56,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:56,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:56,484 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:56,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-13 13:22:56,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 13:22:56,689 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:22:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash 800806349, now seen corresponding path program 1 times [2022-12-13 13:22:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:56,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796899736] [2022-12-13 13:22:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796899736] [2022-12-13 13:22:56,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796899736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:22:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532620344] [2022-12-13 13:22:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:56,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:22:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:22:56,730 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:22:56,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 13:22:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:56,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:22:56,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:56,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:22:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:56,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532620344] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:22:56,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:22:56,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 13:22:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187894610] [2022-12-13 13:22:56,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:22:56,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:22:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:22:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:22:56,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 13:22:56,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 3961 transitions, 198603 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-13 13:22:56,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:56,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 13:22:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:23:40,980 INFO L130 PetriNetUnfolder]: 13222/24920 cut-off events. [2022-12-13 13:23:40,980 INFO L131 PetriNetUnfolder]: For 2533854/2533854 co-relation queries the response was YES. [2022-12-13 13:23:41,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430830 conditions, 24920 events. 13222/24920 cut-off events. For 2533854/2533854 co-relation queries the response was YES. Maximal size of possible extension queue 1943. Compared 239715 event pairs, 2382 based on Foata normal form. 62/24982 useless extension candidates. Maximal degree in co-relation 423026. Up to 15369 conditions per place. [2022-12-13 13:23:41,482 INFO L137 encePairwiseOnDemand]: 16/49 looper letters, 2770 selfloop transitions, 1726 changer transitions 1/4497 dead transitions. [2022-12-13 13:23:41,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 4497 transitions, 226655 flow [2022-12-13 13:23:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:23:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:23:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-12-13 13:23:41,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18524332810047095 [2022-12-13 13:23:41,483 INFO L175 Difference]: Start difference. First operand has 562 places, 3961 transitions, 198603 flow. Second operand 13 states and 118 transitions. [2022-12-13 13:23:41,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 4497 transitions, 226655 flow [2022-12-13 13:24:47,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 4497 transitions, 222355 flow, removed 1811 selfloop flow, removed 6 redundant places. [2022-12-13 13:24:47,677 INFO L231 Difference]: Finished difference. Result has 569 places, 4134 transitions, 207732 flow [2022-12-13 13:24:47,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=194829, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1553, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=207732, PETRI_PLACES=569, PETRI_TRANSITIONS=4134} [2022-12-13 13:24:47,680 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 549 predicate places. [2022-12-13 13:24:47,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:24:47,680 INFO L89 Accepts]: Start accepts. Operand has 569 places, 4134 transitions, 207732 flow [2022-12-13 13:24:47,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:24:47,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:24:47,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 569 places, 4134 transitions, 207732 flow [2022-12-13 13:24:47,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 569 places, 4134 transitions, 207732 flow [2022-12-13 13:24:53,978 INFO L130 PetriNetUnfolder]: 2857/9615 cut-off events. [2022-12-13 13:24:53,979 INFO L131 PetriNetUnfolder]: For 667592/667667 co-relation queries the response was YES. [2022-12-13 13:24:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146691 conditions, 9615 events. 2857/9615 cut-off events. For 667592/667667 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 125641 event pairs, 5 based on Foata normal form. 2/9608 useless extension candidates. Maximal degree in co-relation 144493. Up to 2319 conditions per place. [2022-12-13 13:24:54,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 569 places, 4134 transitions, 207732 flow [2022-12-13 13:24:54,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 15482 [2022-12-13 13:24:54,269 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:24:54,269 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:24:54,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:24:54,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6700 [2022-12-13 13:24:54,380 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 4134 transitions, 207772 flow [2022-12-13 13:24:54,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-13 13:24:54,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:24:54,380 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:24:54,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-13 13:24:54,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-12-13 13:24:54,582 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:24:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:24:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1167972397, now seen corresponding path program 1 times [2022-12-13 13:24:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:24:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333931326] [2022-12-13 13:24:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:24:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:24:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:24:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:24:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:24:54,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333931326] [2022-12-13 13:24:54,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333931326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:24:54,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078842129] [2022-12-13 13:24:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:24:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:24:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:24:54,652 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:24:54,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 13:24:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:24:54,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 13:24:54,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:24:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:24:54,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:24:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:24:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078842129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:24:54,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:24:54,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-12-13 13:24:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576196594] [2022-12-13 13:24:54,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:24:54,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:24:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:24:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:24:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:24:54,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 13:24:54,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 4134 transitions, 207772 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:24:54,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:24:54,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 13:24:54,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:25:37,424 INFO L130 PetriNetUnfolder]: 13591/25649 cut-off events. [2022-12-13 13:25:37,424 INFO L131 PetriNetUnfolder]: For 2510983/2510983 co-relation queries the response was YES. [2022-12-13 13:25:37,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441350 conditions, 25649 events. 13591/25649 cut-off events. For 2510983/2510983 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 247366 event pairs, 942 based on Foata normal form. 12/25661 useless extension candidates. Maximal degree in co-relation 433664. Up to 14620 conditions per place. [2022-12-13 13:25:38,043 INFO L137 encePairwiseOnDemand]: 16/50 looper letters, 2752 selfloop transitions, 1743 changer transitions 78/4573 dead transitions. [2022-12-13 13:25:38,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 4573 transitions, 230033 flow [2022-12-13 13:25:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:25:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:25:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-13 13:25:38,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 13:25:38,044 INFO L175 Difference]: Start difference. First operand has 569 places, 4134 transitions, 207772 flow. Second operand 7 states and 105 transitions. [2022-12-13 13:25:38,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 4573 transitions, 230033 flow Received shutdown request... [2022-12-13 13:25:56,678 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 13:25:56,695 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 13:25:56,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 13:25:56,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-13 13:25:56,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:25:56,897 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-13 13:25:56,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 13:25:56,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 13:25:56,900 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:25:56,902 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:25:56,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:25:56,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:25:56 BasicIcfg [2022-12-13 13:25:56,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:25:56,904 INFO L158 Benchmark]: Toolchain (without parser) took 839720.79ms. Allocated memory was 207.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 183.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-13 13:25:56,904 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 185.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:25:56,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.32ms. Allocated memory is still 207.6MB. Free memory was 183.8MB in the beginning and 172.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 13:25:56,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.81ms. Allocated memory is still 207.6MB. Free memory was 172.8MB in the beginning and 171.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:25:56,905 INFO L158 Benchmark]: Boogie Preprocessor took 34.76ms. Allocated memory is still 207.6MB. Free memory was 171.2MB in the beginning and 169.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 13:25:56,905 INFO L158 Benchmark]: RCFGBuilder took 341.87ms. Allocated memory is still 207.6MB. Free memory was 169.6MB in the beginning and 155.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 13:25:56,905 INFO L158 Benchmark]: TraceAbstraction took 839102.37ms. Allocated memory was 207.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 154.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-13 13:25:56,906 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 185.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.32ms. Allocated memory is still 207.6MB. Free memory was 183.8MB in the beginning and 172.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.81ms. Allocated memory is still 207.6MB. Free memory was 172.8MB in the beginning and 171.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.76ms. Allocated memory is still 207.6MB. Free memory was 171.2MB in the beginning and 169.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 341.87ms. Allocated memory is still 207.6MB. Free memory was 169.6MB in the beginning and 155.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 839102.37ms. Allocated memory was 207.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 154.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 64 PlacesBefore, 20 PlacesAfterwards, 62 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 249, unknown conditional: 0, unknown unconditional: 249] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 388, Positive conditional cache size: 0, Positive unconditional cache size: 388, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 19 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 14, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 58 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): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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, 24 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 3, 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: 0, independent unconditional: 3, 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: 0, independent unconditional: 3, 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: 0, independent unconditional: 3, 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: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 1, Positive unconditional cache size: 10, 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, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 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): 11, Positive cache size: 11, Positive conditional cache size: 1, Positive unconditional cache size: 10, 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.2s, 29 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 3, independent conditional: 3, 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): 16, Positive cache size: 16, Positive conditional cache size: 5, Positive unconditional cache size: 11, 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, 29 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 13, Positive unconditional cache size: 11, 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, 34 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 130 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): 24, Positive cache size: 24, Positive conditional cache size: 13, Positive unconditional cache size: 11, 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.3s, 43 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 11, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 21, Positive unconditional cache size: 11, 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.3s, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 28, Positive unconditional cache size: 11, 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.2s, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 28, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 6, independent conditional: 6, 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): 43, Positive cache size: 43, Positive conditional cache size: 31, Positive unconditional cache size: 12, 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.2s, 59 PlacesBefore, 58 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 35, Positive unconditional cache size: 13, 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.5s, 73 PlacesBefore, 71 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 3, independent conditional: 3, 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): 52, Positive cache size: 52, Positive conditional cache size: 39, Positive unconditional cache size: 13, 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.1s, 78 PlacesBefore, 78 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, 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, 84 PlacesBefore, 84 PlacesAfterwards, 144 TransitionsBefore, 144 TransitionsAfterwards, 446 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): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, 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, 88 PlacesBefore, 88 PlacesAfterwards, 143 TransitionsBefore, 143 TransitionsAfterwards, 440 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): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, 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, 91 PlacesBefore, 91 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 460 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): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 98 PlacesBefore, 98 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 54, Positive conditional cache size: 41, Positive unconditional cache size: 13, 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, 102 PlacesBefore, 102 PlacesAfterwards, 177 TransitionsBefore, 177 TransitionsAfterwards, 592 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): 54, Positive cache size: 54, Positive conditional cache size: 41, Positive unconditional cache size: 13, 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, 106 PlacesBefore, 106 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 612 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): 54, Positive cache size: 54, Positive conditional cache size: 41, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 108 PlacesBefore, 108 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 55, Positive conditional cache size: 42, Positive unconditional cache size: 13, 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, 124 PlacesBefore, 124 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 798 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): 55, Positive cache size: 55, Positive conditional cache size: 42, Positive unconditional cache size: 13, 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, 133 PlacesBefore, 133 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 806 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 4, independent conditional: 4, 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, 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, 135 PlacesBefore, 135 PlacesAfterwards, 252 TransitionsBefore, 252 TransitionsAfterwards, 838 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, 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, 141 PlacesBefore, 141 PlacesAfterwards, 284 TransitionsBefore, 284 TransitionsAfterwards, 978 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, 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, 146 PlacesBefore, 146 PlacesAfterwards, 286 TransitionsBefore, 286 TransitionsAfterwards, 990 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, 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.2s, 156 PlacesBefore, 155 PlacesAfterwards, 311 TransitionsBefore, 310 TransitionsAfterwards, 1096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 60, Positive conditional cache size: 47, Positive unconditional cache size: 13, 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, 158 PlacesBefore, 158 PlacesAfterwards, 310 TransitionsBefore, 310 TransitionsAfterwards, 1094 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): 60, Positive cache size: 60, Positive conditional cache size: 47, Positive unconditional cache size: 13, 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, 166 PlacesBefore, 166 PlacesAfterwards, 326 TransitionsBefore, 326 TransitionsAfterwards, 1170 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): 60, Positive cache size: 60, Positive conditional cache size: 47, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 172 PlacesBefore, 172 PlacesAfterwards, 328 TransitionsBefore, 328 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 48, Positive unconditional cache size: 13, 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, 189 PlacesBefore, 189 PlacesAfterwards, 460 TransitionsBefore, 460 TransitionsAfterwards, 1718 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): 61, Positive cache size: 61, Positive conditional cache size: 48, Positive unconditional cache size: 13, 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.3s, 200 PlacesBefore, 201 PlacesAfterwards, 484 TransitionsBefore, 484 TransitionsAfterwards, 1830 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 53, Positive unconditional cache size: 13, 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, 204 PlacesBefore, 204 PlacesAfterwards, 505 TransitionsBefore, 505 TransitionsAfterwards, 1932 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): 66, Positive cache size: 66, Positive conditional cache size: 53, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 209 PlacesBefore, 209 PlacesAfterwards, 520 TransitionsBefore, 520 TransitionsAfterwards, 2014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 67, Positive conditional cache size: 54, Positive unconditional cache size: 13, 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.1s, 217 PlacesBefore, 217 PlacesAfterwards, 534 TransitionsBefore, 534 TransitionsAfterwards, 2058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 68, Positive conditional cache size: 55, Positive unconditional cache size: 13, 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.2s, 229 PlacesBefore, 229 PlacesAfterwards, 562 TransitionsBefore, 562 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 69, Positive conditional cache size: 56, Positive unconditional cache size: 13, 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, 234 PlacesBefore, 234 PlacesAfterwards, 585 TransitionsBefore, 585 TransitionsAfterwards, 2296 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): 69, Positive cache size: 69, Positive conditional cache size: 56, Positive unconditional cache size: 13, 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.2s, 249 PlacesBefore, 248 PlacesAfterwards, 614 TransitionsBefore, 613 TransitionsAfterwards, 2386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 71, Positive conditional cache size: 58, Positive unconditional cache size: 13, 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.1s, 269 PlacesBefore, 269 PlacesAfterwards, 676 TransitionsBefore, 676 TransitionsAfterwards, 2634 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, 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.1s, 299 PlacesBefore, 298 PlacesAfterwards, 901 TransitionsBefore, 900 TransitionsAfterwards, 3356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 75, Positive cache size: 75, Positive conditional cache size: 62, Positive unconditional cache size: 13, 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, 299 PlacesBefore, 299 PlacesAfterwards, 905 TransitionsBefore, 905 TransitionsAfterwards, 3360 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): 75, Positive cache size: 75, Positive conditional cache size: 62, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 303 PlacesBefore, 302 PlacesAfterwards, 1039 TransitionsBefore, 1038 TransitionsAfterwards, 3808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 64, Positive unconditional cache size: 13, 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.1s, 316 PlacesBefore, 316 PlacesAfterwards, 1178 TransitionsBefore, 1178 TransitionsAfterwards, 4250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 65, Positive unconditional cache size: 13, 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.1s, 330 PlacesBefore, 330 PlacesAfterwards, 1261 TransitionsBefore, 1261 TransitionsAfterwards, 4608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, 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, 334 PlacesBefore, 334 PlacesAfterwards, 1267 TransitionsBefore, 1267 TransitionsAfterwards, 4624 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): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, 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, 342 PlacesBefore, 342 PlacesAfterwards, 1297 TransitionsBefore, 1297 TransitionsAfterwards, 4724 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): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, 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, 353 PlacesBefore, 353 PlacesAfterwards, 1396 TransitionsBefore, 1396 TransitionsAfterwards, 5058 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): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 357 PlacesBefore, 357 PlacesAfterwards, 1794 TransitionsBefore, 1794 TransitionsAfterwards, 6662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 80, Positive conditional cache size: 67, Positive unconditional cache size: 13, 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, 373 PlacesBefore, 373 PlacesAfterwards, 2165 TransitionsBefore, 2165 TransitionsAfterwards, 8076 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): 80, Positive cache size: 80, Positive conditional cache size: 67, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 391 PlacesBefore, 391 PlacesAfterwards, 2270 TransitionsBefore, 2270 TransitionsAfterwards, 8550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 81, Positive conditional cache size: 68, Positive unconditional cache size: 13, 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.3s, 413 PlacesBefore, 412 PlacesAfterwards, 2386 TransitionsBefore, 2385 TransitionsAfterwards, 8970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 422 PlacesBefore, 422 PlacesAfterwards, 2408 TransitionsBefore, 2408 TransitionsAfterwards, 9074 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 451 PlacesBefore, 451 PlacesAfterwards, 2665 TransitionsBefore, 2665 TransitionsAfterwards, 9908 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 467 PlacesBefore, 467 PlacesAfterwards, 2782 TransitionsBefore, 2782 TransitionsAfterwards, 10394 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 475 PlacesBefore, 475 PlacesAfterwards, 2789 TransitionsBefore, 2789 TransitionsAfterwards, 10428 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 515 PlacesBefore, 515 PlacesAfterwards, 3173 TransitionsBefore, 3173 TransitionsAfterwards, 11788 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 528 PlacesBefore, 528 PlacesAfterwards, 3276 TransitionsBefore, 3276 TransitionsAfterwards, 12246 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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.2s, 534 PlacesBefore, 534 PlacesAfterwards, 3394 TransitionsBefore, 3394 TransitionsAfterwards, 12702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 72, Positive unconditional cache size: 13, 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, 562 PlacesBefore, 562 PlacesAfterwards, 3961 TransitionsBefore, 3961 TransitionsAfterwards, 14720 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): 85, Positive cache size: 85, Positive conditional cache size: 72, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 569 PlacesBefore, 569 PlacesAfterwards, 4134 TransitionsBefore, 4134 TransitionsAfterwards, 15482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 86, Positive conditional cache size: 73, Positive unconditional cache size: 13, 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 - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 839.0s, OverallIterations: 62, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 749.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2974 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2974 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 2421 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15614 IncrementalHoareTripleChecker+Invalid, 18035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2421 mSolverCounterUnsat, 6 mSDtfsCounter, 15614 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2033 GetRequests, 1228 SyntacticMatches, 150 SemanticMatches, 655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207772occurred in iteration=61, InterpolantAutomatonStates: 618, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1607 NumberOfCodeBlocks, 1607 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 2175 ConstructedInterpolants, 0 QuantifiedInterpolants, 6836 SizeOfPredicates, 101 NumberOfNonLiveVariables, 7007 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 164 InterpolantComputations, 11 PerfectInterpolantSequences, 35/543 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