/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/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:40:52,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:40:52,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:40:52,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:40:52,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:40:52,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:40:52,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:40:52,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:40:52,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:40:52,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:40:52,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:40:52,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:40:52,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:40:52,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:40:52,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:40:52,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:40:52,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:40:52,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:40:52,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:40:52,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:40:52,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:40:52,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:40:52,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:40:52,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:40:52,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:40:52,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:40:52,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:40:52,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:40:52,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:40:52,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:40:52,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:40:52,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:40:52,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:40:52,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:40:52,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:40:52,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:40:52,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:40:52,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:40:52,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:40:52,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:40:52,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:40:52,532 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:40:52,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:40:52,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:40:52,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:40:52,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:40:52,567 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:40:52,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:40:52,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:40:52,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:40:52,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:40:52,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:40:52,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:40:52,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:40:52,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:40:52,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:40:52,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:40:52,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:40:52,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:40:52,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:40:52,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:40:52,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:40:52,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:40:52,571 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:40:52,571 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:40:52,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:40:52,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:40:52,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:40:52,918 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:40:52,918 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:40:52,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-13 13:40:53,987 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:40:54,228 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:40:54,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-13 13:40:54,236 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb76e2ba8/abfb4686098f4e969a74023998eef423/FLAG28fcaf4df [2022-12-13 13:40:54,258 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb76e2ba8/abfb4686098f4e969a74023998eef423 [2022-12-13 13:40:54,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:40:54,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:40:54,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:40:54,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:40:54,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:40:54,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c432bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54, skipping insertion in model container [2022-12-13 13:40:54,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:40:54,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:40:54,476 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/unroll-cond-3.wvr.c[2641,2654] [2022-12-13 13:40:54,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:40:54,501 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:40:54,533 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/unroll-cond-3.wvr.c[2641,2654] [2022-12-13 13:40:54,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:40:54,549 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:40:54,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54 WrapperNode [2022-12-13 13:40:54,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:40:54,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:40:54,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:40:54,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:40:54,559 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:40:54" (1/1) ... [2022-12-13 13:40:54,577 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:40:54" (1/1) ... [2022-12-13 13:40:54,607 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-12-13 13:40:54,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:40:54,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:40:54,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:40:54,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:40:54,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:40:54,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:40:54,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:40:54,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:40:54,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (1/1) ... [2022-12-13 13:40:54,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:40:54,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:54,683 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:40:54,705 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:40:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:40:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:40:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:40:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:40:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:40:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:40:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:40:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:40:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:40:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:40:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:40:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:40:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:40:54,724 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:40:54,864 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:40:54,866 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:40:55,218 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:40:55,225 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:40:55,226 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:40:55,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:55 BoogieIcfgContainer [2022-12-13 13:40:55,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:40:55,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:40:55,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:40:55,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:40:55,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:40:54" (1/3) ... [2022-12-13 13:40:55,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7414daa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:40:55, skipping insertion in model container [2022-12-13 13:40:55,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:54" (2/3) ... [2022-12-13 13:40:55,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7414daa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:40:55, skipping insertion in model container [2022-12-13 13:40:55,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:55" (3/3) ... [2022-12-13 13:40:55,247 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-12-13 13:40:55,263 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:40:55,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:40:55,263 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:40:55,376 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 13:40:55,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 191 transitions, 398 flow [2022-12-13 13:40:55,512 INFO L130 PetriNetUnfolder]: 18/189 cut-off events. [2022-12-13 13:40:55,512 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:40:55,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 189 events. 18/189 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 13:40:55,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 191 transitions, 398 flow [2022-12-13 13:40:55,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 181 transitions, 374 flow [2022-12-13 13:40:55,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:55,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-13 13:40:55,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 181 transitions, 374 flow [2022-12-13 13:40:55,606 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-13 13:40:55,606 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:40:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 18/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 274 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 13:40:55,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-13 13:40:55,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 4092 [2022-12-13 13:41:01,584 INFO L241 LiptonReduction]: Total number of compositions: 162 [2022-12-13 13:41:01,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:41:01,614 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;@854feb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:41:01,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 13:41:01,627 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 13:41:01,627 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:41:01,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:01,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:01,629 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:41:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1355763279, now seen corresponding path program 1 times [2022-12-13 13:41:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258711567] [2022-12-13 13:41:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:02,040 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:41:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:02,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258711567] [2022-12-13 13:41:02,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258711567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:02,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:02,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:41:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257024489] [2022-12-13 13:41:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:02,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:02,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 13:41:02,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:41:02,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:02,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 13:41:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:02,136 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 13:41:02,136 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 13:41:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-13 13:41:02,139 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 13:41:02,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 13:41:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 13:41:02,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 13:41:02,150 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-13 13:41:02,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 13:41:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:41:02,155 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-13 13:41:02,156 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-13 13:41:02,160 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 13:41:02,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:02,161 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 13:41:02,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:02,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:02,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 13:41:02,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 13:41:02,176 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 13:41:02,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:41:02,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-13 13:41:02,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 13:41:02,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 13:41:03,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:03,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 886 [2022-12-13 13:41:03,047 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-13 13:41:03,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:41:03,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:03,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:41:03,047 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:41:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1825621982, now seen corresponding path program 1 times [2022-12-13 13:41:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83741073] [2022-12-13 13:41:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:03,329 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:41:03,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:03,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83741073] [2022-12-13 13:41:03,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83741073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:03,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:03,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137358030] [2022-12-13 13:41:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:03,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:03,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:03,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:03,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:41:03,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 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:41:03,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:03,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:41:03,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:03,495 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-13 13:41:03,496 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:41:03,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 368 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-13 13:41:03,498 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-13 13:41:03,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-13 13:41:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:41:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 13:41:03,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 13:41:03,500 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-13 13:41:03,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-13 13:41:03,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:03,502 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-13 13:41:03,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-13 13:41:03,503 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 13:41:03,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:03,503 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-13 13:41:03,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:03,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:03,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-13 13:41:03,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-13 13:41:03,510 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-13 13:41:03,510 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-13 13:41:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-13 13:41:03,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-13 13:41:03,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 13:41:03,673 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:41:03,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 13:41:03,675 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow [2022-12-13 13:41:03,675 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:41:03,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:03,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:03,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:41:03,676 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:41:03,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1532974384, now seen corresponding path program 1 times [2022-12-13 13:41:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:03,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997525273] [2022-12-13 13:41:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:03,821 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:41:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:03,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997525273] [2022-12-13 13:41:03,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997525273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:03,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:03,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870402975] [2022-12-13 13:41:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:03,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 13:41:03,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 65 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:41:03,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:03,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 13:41:03,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:03,938 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-13 13:41:03,939 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-13 13:41:03,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 169 events. 87/169 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 526 event pairs, 33 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2022-12-13 13:41:03,941 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 32 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-13 13:41:03,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 199 flow [2022-12-13 13:41:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 13:41:03,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 13:41:03,945 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 65 flow. Second operand 4 states and 36 transitions. [2022-12-13 13:41:03,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 199 flow [2022-12-13 13:41:03,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 169 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:03,948 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 72 flow [2022-12-13 13:41:03,948 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-12-13 13:41:03,949 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 13:41:03,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:03,949 INFO L89 Accepts]: Start accepts. Operand has 26 places, 20 transitions, 72 flow [2022-12-13 13:41:03,950 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:03,950 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:03,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 72 flow [2022-12-13 13:41:03,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 72 flow [2022-12-13 13:41:03,958 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-13 13:41:03,958 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 13:41:03,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 6 conditions per place. [2022-12-13 13:41:03,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 72 flow [2022-12-13 13:41:03,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 13:41:04,053 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:04,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 13:41:04,054 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 75 flow [2022-12-13 13:41:04,054 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:41:04,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:04,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:04,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:41:04,055 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:41:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1412493814, now seen corresponding path program 2 times [2022-12-13 13:41:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330190189] [2022-12-13 13:41:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:04,216 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:41:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:04,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330190189] [2022-12-13 13:41:04,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330190189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:04,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:04,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628712983] [2022-12-13 13:41:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:04,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:04,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:41:04,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 75 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:41:04,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:04,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:41:04,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:04,298 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-13 13:41:04,298 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-13 13:41:04,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 149 events. 77/149 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 432 event pairs, 42 based on Foata normal form. 4/128 useless extension candidates. Maximal degree in co-relation 272. Up to 126 conditions per place. [2022-12-13 13:41:04,299 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-13 13:41:04,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2022-12-13 13:41:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 13:41:04,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-13 13:41:04,301 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 75 flow. Second operand 4 states and 31 transitions. [2022-12-13 13:41:04,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2022-12-13 13:41:04,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 148 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:04,303 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 70 flow [2022-12-13 13:41:04,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-13 13:41:04,303 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-13 13:41:04,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:04,304 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 70 flow [2022-12-13 13:41:04,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:04,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:04,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 70 flow [2022-12-13 13:41:04,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2022-12-13 13:41:04,309 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-13 13:41:04,309 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-12-13 13:41:04,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 3/29 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-13 13:41:04,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2022-12-13 13:41:04,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 13:41:04,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:04,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 389 [2022-12-13 13:41:04,692 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 64 flow [2022-12-13 13:41:04,692 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:41:04,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:04,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:04,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:41:04,693 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:41:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1685689284, now seen corresponding path program 1 times [2022-12-13 13:41:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:04,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608469087] [2022-12-13 13:41:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:04,874 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:41:04,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:04,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608469087] [2022-12-13 13:41:04,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608469087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:04,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:04,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815008907] [2022-12-13 13:41:04,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:04,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:04,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:41:04,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 64 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:41:04,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:04,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:41:04,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:05,007 INFO L130 PetriNetUnfolder]: 93/181 cut-off events. [2022-12-13 13:41:05,008 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 13:41:05,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 181 events. 93/181 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 577 event pairs, 42 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 413. Up to 130 conditions per place. [2022-12-13 13:41:05,009 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2022-12-13 13:41:05,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 36 transitions, 186 flow [2022-12-13 13:41:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 13:41:05,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-13 13:41:05,011 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-13 13:41:05,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 36 transitions, 186 flow [2022-12-13 13:41:05,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 166 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:05,013 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 81 flow [2022-12-13 13:41:05,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2022-12-13 13:41:05,015 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 13:41:05,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:05,015 INFO L89 Accepts]: Start accepts. Operand has 26 places, 22 transitions, 81 flow [2022-12-13 13:41:05,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:05,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:05,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-13 13:41:05,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 81 flow [2022-12-13 13:41:05,022 INFO L130 PetriNetUnfolder]: 5/41 cut-off events. [2022-12-13 13:41:05,023 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-13 13:41:05,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 41 events. 5/41 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 13:41:05,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-13 13:41:05,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-13 13:41:05,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:41:05,500 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:41:05,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 486 [2022-12-13 13:41:05,501 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 92 flow [2022-12-13 13:41:05,501 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:41:05,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:05,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:05,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:41:05,502 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:41:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1941960187, now seen corresponding path program 1 times [2022-12-13 13:41:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:05,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465316688] [2022-12-13 13:41:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:05,610 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:41:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:05,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465316688] [2022-12-13 13:41:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465316688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:05,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:05,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865103678] [2022-12-13 13:41:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:05,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:05,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 13:41:05,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 92 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:41:05,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:05,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 13:41:05,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:05,753 INFO L130 PetriNetUnfolder]: 139/273 cut-off events. [2022-12-13 13:41:05,753 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2022-12-13 13:41:05,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 273 events. 139/273 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1071 event pairs, 62 based on Foata normal form. 4/234 useless extension candidates. Maximal degree in co-relation 512. Up to 180 conditions per place. [2022-12-13 13:41:05,754 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 13:41:05,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 258 flow [2022-12-13 13:41:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:41:05,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-13 13:41:05,756 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 92 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:41:05,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 43 transitions, 258 flow [2022-12-13 13:41:05,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 248 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 13:41:05,760 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 106 flow [2022-12-13 13:41:05,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-13 13:41:05,763 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-13 13:41:05,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:05,763 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 106 flow [2022-12-13 13:41:05,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:05,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:05,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-13 13:41:05,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 106 flow [2022-12-13 13:41:05,770 INFO L130 PetriNetUnfolder]: 4/54 cut-off events. [2022-12-13 13:41:05,770 INFO L131 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-12-13 13:41:05,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 54 events. 4/54 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-12-13 13:41:05,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-13 13:41:05,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 13:41:05,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [783] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_157| v_~f~0.base_129))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_129 (* v_~x2~0_243 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_129 (* .cse1 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_243) (< v_~x2~0_243 v_~size~0_115)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_208|)) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_51| 4294967296) (mod v_~n~0_99 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_51| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_115)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) (mod (+ v_~n~0_99 4294967294) 4294967296)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (select .cse2 (+ v_~f~0.offset_129 (* .cse0 4))) v_~x2~0_242))))) InVars {~x2~0=v_~x2~0_243, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_129, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_99, ~f~0.offset=v_~f~0.offset_129} OutVars{~x2~0=v_~x2~0_242, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, ~size~0=v_~size~0_115, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~f~0.base=v_~f~0.base_129, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|, ~f~0.offset=v_~f~0.offset_129, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_43|, ~n~0=v_~n~0_99, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 13:41:06,180 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:06,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-13 13:41:06,181 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 107 flow [2022-12-13 13:41:06,181 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:41:06,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:06,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:06,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:41:06,182 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:41:06,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:06,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1695881691, now seen corresponding path program 2 times [2022-12-13 13:41:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:06,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119293075] [2022-12-13 13:41:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:06,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:06,263 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:41:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119293075] [2022-12-13 13:41:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119293075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:06,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097112856] [2022-12-13 13:41:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:06,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 13:41:06,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 107 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:41:06,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:06,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 13:41:06,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:06,365 INFO L130 PetriNetUnfolder]: 140/276 cut-off events. [2022-12-13 13:41:06,365 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-13 13:41:06,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 276 events. 140/276 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1039 event pairs, 89 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 672. Up to 241 conditions per place. [2022-12-13 13:41:06,367 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-13 13:41:06,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 222 flow [2022-12-13 13:41:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 13:41:06,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 13:41:06,369 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 107 flow. Second operand 4 states and 32 transitions. [2022-12-13 13:41:06,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 222 flow [2022-12-13 13:41:06,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 207 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:06,371 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 122 flow [2022-12-13 13:41:06,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-13 13:41:06,371 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-13 13:41:06,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:06,371 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 122 flow [2022-12-13 13:41:06,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:06,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:06,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-13 13:41:06,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 122 flow [2022-12-13 13:41:06,380 INFO L130 PetriNetUnfolder]: 7/64 cut-off events. [2022-12-13 13:41:06,380 INFO L131 PetriNetUnfolder]: For 48/54 co-relation queries the response was YES. [2022-12-13 13:41:06,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 64 events. 7/64 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 249 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 89. Up to 9 conditions per place. [2022-12-13 13:41:06,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-13 13:41:06,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 13:41:06,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:06,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 13:41:06,528 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 116 flow [2022-12-13 13:41:06,528 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:41:06,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:06,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:06,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:41:06,529 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:41:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1493526263, now seen corresponding path program 1 times [2022-12-13 13:41:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:06,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083445681] [2022-12-13 13:41:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:06,687 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:41:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083445681] [2022-12-13 13:41:06,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083445681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:06,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:06,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:06,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300181979] [2022-12-13 13:41:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:06,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:06,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:06,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:41:06,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 116 flow. Second operand has 3 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:41:06,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:06,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:41:06,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:06,786 INFO L130 PetriNetUnfolder]: 142/280 cut-off events. [2022-12-13 13:41:06,786 INFO L131 PetriNetUnfolder]: For 476/476 co-relation queries the response was YES. [2022-12-13 13:41:06,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 280 events. 142/280 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1065 event pairs, 96 based on Foata normal form. 4/269 useless extension candidates. Maximal degree in co-relation 749. Up to 276 conditions per place. [2022-12-13 13:41:06,788 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 27 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-13 13:41:06,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 185 flow [2022-12-13 13:41:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 13:41:06,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 13:41:06,791 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 116 flow. Second operand 3 states and 27 transitions. [2022-12-13 13:41:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 185 flow [2022-12-13 13:41:06,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 176 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:06,794 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 121 flow [2022-12-13 13:41:06,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-13 13:41:06,796 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-13 13:41:06,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:06,796 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 121 flow [2022-12-13 13:41:06,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:06,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:06,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 121 flow [2022-12-13 13:41:06,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 121 flow [2022-12-13 13:41:06,805 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-13 13:41:06,806 INFO L131 PetriNetUnfolder]: For 45/50 co-relation queries the response was YES. [2022-12-13 13:41:06,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 64 events. 6/64 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 259 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 103. Up to 9 conditions per place. [2022-12-13 13:41:06,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 121 flow [2022-12-13 13:41:06,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 13:41:07,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:07,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 594 [2022-12-13 13:41:07,390 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 117 flow [2022-12-13 13:41:07,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:41:07,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:07,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:07,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:41:07,391 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:41:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash 68936365, now seen corresponding path program 3 times [2022-12-13 13:41:07,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:07,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882983348] [2022-12-13 13:41:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:07,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:07,478 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:41:07,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882983348] [2022-12-13 13:41:07,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882983348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:07,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:07,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109192719] [2022-12-13 13:41:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:07,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:07,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:07,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:07,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:41:07,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 117 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:41:07,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:07,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:41:07,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:07,586 INFO L130 PetriNetUnfolder]: 138/266 cut-off events. [2022-12-13 13:41:07,586 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2022-12-13 13:41:07,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 266 events. 138/266 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1017 event pairs, 54 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 797. Up to 182 conditions per place. [2022-12-13 13:41:07,588 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 35 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-12-13 13:41:07,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 251 flow [2022-12-13 13:41:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 13:41:07,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2022-12-13 13:41:07,589 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 117 flow. Second operand 4 states and 39 transitions. [2022-12-13 13:41:07,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 251 flow [2022-12-13 13:41:07,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 237 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:07,591 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 136 flow [2022-12-13 13:41:07,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-13 13:41:07,592 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 13:41:07,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:07,592 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 136 flow [2022-12-13 13:41:07,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:07,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:07,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 136 flow [2022-12-13 13:41:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 136 flow [2022-12-13 13:41:07,601 INFO L130 PetriNetUnfolder]: 8/59 cut-off events. [2022-12-13 13:41:07,601 INFO L131 PetriNetUnfolder]: For 74/85 co-relation queries the response was YES. [2022-12-13 13:41:07,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 59 events. 8/59 cut-off events. For 74/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 208 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 96. Up to 8 conditions per place. [2022-12-13 13:41:07,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 136 flow [2022-12-13 13:41:07,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 13:41:07,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~f~0.base_127))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_127 (* v_~x2~0_236 4))))) (and (<= (mod (+ v_~n~0_97 4294967294) 4294967296) 0) (not (= (ite (and (<= 0 v_~x2~0_236) (< v_~x2~0_236 v_~size~0_113)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190| 0)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_127)) v_~x2~0_235) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (< .cse1 v_~size~0_113) (<= 0 .cse1)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0)))) InVars {~x2~0=v_~x2~0_236, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, ~f~0.offset=v_~f~0.offset_127, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} OutVars{~x2~0=v_~x2~0_235, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_37|, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~f~0.offset=v_~f~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_45|, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [766] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= v_~x1~0_Out_6 (select (select |v_#memory_int_In_11| v_~f~0.base_In_7) (+ v_~f~0.offset_In_7 (* v_~x1~0_In_3 4)))) (= (ite (and (< v_~x1~0_In_3 v_~size~0_In_7) (<= 0 v_~x1~0_In_3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod v_~n~0_In_5 4294967296))) InVars {~size~0=v_~size~0_In_7, ~f~0.base=v_~f~0.base_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_11|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_In_3, ~f~0.offset=v_~f~0.offset_In_7} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_7, ~f~0.base=v_~f~0.base_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_11|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_Out_6, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:41:07,951 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:41:07,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 360 [2022-12-13 13:41:07,952 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 139 flow [2022-12-13 13:41:07,952 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:41:07,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:07,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:07,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:41:07,953 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:41:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1608042867, now seen corresponding path program 1 times [2022-12-13 13:41:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106111514] [2022-12-13 13:41:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:08,060 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:41:08,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:08,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106111514] [2022-12-13 13:41:08,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106111514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:08,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:08,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333316838] [2022-12-13 13:41:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:08,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:08,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:08,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 13:41:08,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 139 flow. Second operand has 3 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:41:08,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:08,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 13:41:08,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:08,150 INFO L130 PetriNetUnfolder]: 140/270 cut-off events. [2022-12-13 13:41:08,150 INFO L131 PetriNetUnfolder]: For 741/741 co-relation queries the response was YES. [2022-12-13 13:41:08,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 270 events. 140/270 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 991 event pairs, 94 based on Foata normal form. 4/259 useless extension candidates. Maximal degree in co-relation 706. Up to 266 conditions per place. [2022-12-13 13:41:08,152 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-13 13:41:08,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 210 flow [2022-12-13 13:41:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-13 13:41:08,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-13 13:41:08,153 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 139 flow. Second operand 3 states and 29 transitions. [2022-12-13 13:41:08,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 210 flow [2022-12-13 13:41:08,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 191 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 13:41:08,155 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 134 flow [2022-12-13 13:41:08,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-13 13:41:08,156 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-13 13:41:08,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:08,156 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 134 flow [2022-12-13 13:41:08,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:08,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:08,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 134 flow [2022-12-13 13:41:08,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 134 flow [2022-12-13 13:41:08,163 INFO L130 PetriNetUnfolder]: 7/59 cut-off events. [2022-12-13 13:41:08,164 INFO L131 PetriNetUnfolder]: For 59/72 co-relation queries the response was YES. [2022-12-13 13:41:08,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 59 events. 7/59 cut-off events. For 59/72 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 216 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 102. Up to 8 conditions per place. [2022-12-13 13:41:08,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 134 flow [2022-12-13 13:41:08,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 13:41:09,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:09,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 911 [2022-12-13 13:41:09,068 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 130 flow [2022-12-13 13:41:09,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:41:09,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:09,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:41:09,068 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:41:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1745000772, now seen corresponding path program 1 times [2022-12-13 13:41:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:09,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819609625] [2022-12-13 13:41:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:09,698 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:41:09,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:09,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819609625] [2022-12-13 13:41:09,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819609625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:09,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:09,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:09,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955262129] [2022-12-13 13:41:09,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:09,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:09,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:09,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 13:41:09,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 130 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:41:09,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:09,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 13:41:09,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:10,058 INFO L130 PetriNetUnfolder]: 227/438 cut-off events. [2022-12-13 13:41:10,058 INFO L131 PetriNetUnfolder]: For 736/736 co-relation queries the response was YES. [2022-12-13 13:41:10,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 438 events. 227/438 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1915 event pairs, 50 based on Foata normal form. 3/411 useless extension candidates. Maximal degree in co-relation 1361. Up to 248 conditions per place. [2022-12-13 13:41:10,061 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 39 selfloop transitions, 11 changer transitions 20/70 dead transitions. [2022-12-13 13:41:10,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 70 transitions, 470 flow [2022-12-13 13:41:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:41:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:41:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-13 13:41:10,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-13 13:41:10,063 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 130 flow. Second operand 7 states and 69 transitions. [2022-12-13 13:41:10,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 70 transitions, 470 flow [2022-12-13 13:41:10,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 70 transitions, 452 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:10,067 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 229 flow [2022-12-13 13:41:10,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 13:41:10,068 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-13 13:41:10,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:10,068 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 229 flow [2022-12-13 13:41:10,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:10,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:10,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 229 flow [2022-12-13 13:41:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 229 flow [2022-12-13 13:41:10,083 INFO L130 PetriNetUnfolder]: 17/97 cut-off events. [2022-12-13 13:41:10,083 INFO L131 PetriNetUnfolder]: For 163/185 co-relation queries the response was YES. [2022-12-13 13:41:10,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 97 events. 17/97 cut-off events. For 163/185 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 426 event pairs, 0 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 225. Up to 18 conditions per place. [2022-12-13 13:41:10,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 229 flow [2022-12-13 13:41:10,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 13:41:11,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 13:41:12,121 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:41:12,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2054 [2022-12-13 13:41:12,122 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 239 flow [2022-12-13 13:41:12,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:41:12,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:12,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:12,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:41:12,128 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:41:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1333084920, now seen corresponding path program 1 times [2022-12-13 13:41:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:12,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912359476] [2022-12-13 13:41:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:12,245 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:41:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:12,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912359476] [2022-12-13 13:41:12,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912359476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:12,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:12,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43639429] [2022-12-13 13:41:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:12,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:12,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:12,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 13:41:12,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:12,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:12,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 13:41:12,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:12,356 INFO L130 PetriNetUnfolder]: 174/361 cut-off events. [2022-12-13 13:41:12,356 INFO L131 PetriNetUnfolder]: For 727/727 co-relation queries the response was YES. [2022-12-13 13:41:12,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 361 events. 174/361 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1573 event pairs, 106 based on Foata normal form. 4/346 useless extension candidates. Maximal degree in co-relation 1181. Up to 357 conditions per place. [2022-12-13 13:41:12,359 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 36 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-13 13:41:12,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 313 flow [2022-12-13 13:41:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 13:41:12,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 13:41:12,360 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 239 flow. Second operand 3 states and 30 transitions. [2022-12-13 13:41:12,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 313 flow [2022-12-13 13:41:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 290 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:12,363 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 217 flow [2022-12-13 13:41:12,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-13 13:41:12,364 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 13:41:12,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:12,364 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 217 flow [2022-12-13 13:41:12,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:12,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:12,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 217 flow [2022-12-13 13:41:12,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 217 flow [2022-12-13 13:41:12,379 INFO L130 PetriNetUnfolder]: 15/108 cut-off events. [2022-12-13 13:41:12,379 INFO L131 PetriNetUnfolder]: For 138/142 co-relation queries the response was YES. [2022-12-13 13:41:12,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 108 events. 15/108 cut-off events. For 138/142 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 563 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 235. Up to 18 conditions per place. [2022-12-13 13:41:12,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 217 flow [2022-12-13 13:41:12,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 13:41:13,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:13,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1206 [2022-12-13 13:41:13,570 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 213 flow [2022-12-13 13:41:13,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:13,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:13,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:13,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:41:13,570 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:41:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash -22692000, now seen corresponding path program 1 times [2022-12-13 13:41:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:13,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346958730] [2022-12-13 13:41:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:13,697 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:41:13,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346958730] [2022-12-13 13:41:13,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346958730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:13,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:13,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550189051] [2022-12-13 13:41:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:13,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:13,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:13,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:13,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:41:13,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 213 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:41:13,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:13,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:41:13,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:13,863 INFO L130 PetriNetUnfolder]: 171/350 cut-off events. [2022-12-13 13:41:13,864 INFO L131 PetriNetUnfolder]: For 816/816 co-relation queries the response was YES. [2022-12-13 13:41:13,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 350 events. 171/350 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1504 event pairs, 78 based on Foata normal form. 16/347 useless extension candidates. Maximal degree in co-relation 1156. Up to 248 conditions per place. [2022-12-13 13:41:13,866 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 43 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2022-12-13 13:41:13,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 372 flow [2022-12-13 13:41:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 13:41:13,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-13 13:41:13,867 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 213 flow. Second operand 4 states and 41 transitions. [2022-12-13 13:41:13,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 372 flow [2022-12-13 13:41:13,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 356 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:13,871 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 240 flow [2022-12-13 13:41:13,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 13:41:13,872 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 13:41:13,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:13,872 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 240 flow [2022-12-13 13:41:13,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:13,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:13,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 240 flow [2022-12-13 13:41:13,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 240 flow [2022-12-13 13:41:13,886 INFO L130 PetriNetUnfolder]: 15/101 cut-off events. [2022-12-13 13:41:13,886 INFO L131 PetriNetUnfolder]: For 184/195 co-relation queries the response was YES. [2022-12-13 13:41:13,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 101 events. 15/101 cut-off events. For 184/195 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 476 event pairs, 0 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 202. Up to 16 conditions per place. [2022-12-13 13:41:13,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 240 flow [2022-12-13 13:41:13,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 13:41:14,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:14,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 545 [2022-12-13 13:41:14,417 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 234 flow [2022-12-13 13:41:14,417 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:41:14,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:14,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:41:14,418 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:41:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1476230675, now seen corresponding path program 1 times [2022-12-13 13:41:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012746709] [2022-12-13 13:41:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:14,552 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:41:14,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:14,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012746709] [2022-12-13 13:41:14,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012746709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:14,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:14,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226005511] [2022-12-13 13:41:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:14,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 13:41:14,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:14,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:14,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 13:41:14,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:14,658 INFO L130 PetriNetUnfolder]: 162/329 cut-off events. [2022-12-13 13:41:14,658 INFO L131 PetriNetUnfolder]: For 975/975 co-relation queries the response was YES. [2022-12-13 13:41:14,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 329 events. 162/329 cut-off events. For 975/975 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1357 event pairs, 94 based on Foata normal form. 4/314 useless extension candidates. Maximal degree in co-relation 986. Up to 325 conditions per place. [2022-12-13 13:41:14,660 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 37 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-13 13:41:14,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 325 flow [2022-12-13 13:41:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-13 13:41:14,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2022-12-13 13:41:14,661 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 234 flow. Second operand 3 states and 31 transitions. [2022-12-13 13:41:14,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 325 flow [2022-12-13 13:41:14,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 308 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:14,665 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 233 flow [2022-12-13 13:41:14,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 13:41:14,666 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 13:41:14,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:14,666 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 233 flow [2022-12-13 13:41:14,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:14,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:14,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 233 flow [2022-12-13 13:41:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 233 flow [2022-12-13 13:41:14,681 INFO L130 PetriNetUnfolder]: 15/100 cut-off events. [2022-12-13 13:41:14,681 INFO L131 PetriNetUnfolder]: For 138/142 co-relation queries the response was YES. [2022-12-13 13:41:14,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 100 events. 15/100 cut-off events. For 138/142 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 480 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 222. Up to 15 conditions per place. [2022-12-13 13:41:14,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 233 flow [2022-12-13 13:41:14,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 13:41:16,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:16,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1403 [2022-12-13 13:41:16,069 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 229 flow [2022-12-13 13:41:16,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:16,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:16,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:16,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:41:16,070 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:41:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1619451049, now seen corresponding path program 1 times [2022-12-13 13:41:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:16,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953251992] [2022-12-13 13:41:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:16,236 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:41:16,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:16,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953251992] [2022-12-13 13:41:16,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953251992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:16,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:16,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:16,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331924538] [2022-12-13 13:41:16,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:16,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:16,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:16,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:16,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 13:41:16,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 229 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:41:16,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:16,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 13:41:16,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:16,520 INFO L130 PetriNetUnfolder]: 199/404 cut-off events. [2022-12-13 13:41:16,520 INFO L131 PetriNetUnfolder]: For 994/994 co-relation queries the response was YES. [2022-12-13 13:41:16,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 404 events. 199/404 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1796 event pairs, 92 based on Foata normal form. 8/389 useless extension candidates. Maximal degree in co-relation 1357. Up to 331 conditions per place. [2022-12-13 13:41:16,523 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 48 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2022-12-13 13:41:16,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 419 flow [2022-12-13 13:41:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 13:41:16,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-13 13:41:16,524 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 229 flow. Second operand 4 states and 45 transitions. [2022-12-13 13:41:16,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 419 flow [2022-12-13 13:41:16,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 403 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:16,527 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 273 flow [2022-12-13 13:41:16,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 13:41:16,527 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-13 13:41:16,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:16,528 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 273 flow [2022-12-13 13:41:16,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:16,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:16,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 273 flow [2022-12-13 13:41:16,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 273 flow [2022-12-13 13:41:16,544 INFO L130 PetriNetUnfolder]: 18/123 cut-off events. [2022-12-13 13:41:16,545 INFO L131 PetriNetUnfolder]: For 206/212 co-relation queries the response was YES. [2022-12-13 13:41:16,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 123 events. 18/123 cut-off events. For 206/212 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 655 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 236. Up to 19 conditions per place. [2022-12-13 13:41:16,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 273 flow [2022-12-13 13:41:16,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 13:41:16,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:41:16,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:41:16,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:16,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 365 [2022-12-13 13:41:16,892 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 302 flow [2022-12-13 13:41:16,892 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:41:16,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:16,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:16,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:41:16,893 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:41:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1584800819, now seen corresponding path program 1 times [2022-12-13 13:41:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882060848] [2022-12-13 13:41:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:17,007 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:41:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:17,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882060848] [2022-12-13 13:41:17,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882060848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:17,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:17,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786925831] [2022-12-13 13:41:17,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:17,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:17,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:17,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:41:17,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:17,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:17,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:41:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:17,133 INFO L130 PetriNetUnfolder]: 198/407 cut-off events. [2022-12-13 13:41:17,133 INFO L131 PetriNetUnfolder]: For 1167/1167 co-relation queries the response was YES. [2022-12-13 13:41:17,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 407 events. 198/407 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1824 event pairs, 116 based on Foata normal form. 4/388 useless extension candidates. Maximal degree in co-relation 1220. Up to 403 conditions per place. [2022-12-13 13:41:17,136 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 42 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-13 13:41:17,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 403 flow [2022-12-13 13:41:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-13 13:41:17,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 13:41:17,137 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 302 flow. Second operand 3 states and 33 transitions. [2022-12-13 13:41:17,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 403 flow [2022-12-13 13:41:17,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 385 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-13 13:41:17,146 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 300 flow [2022-12-13 13:41:17,146 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-13 13:41:17,147 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 13:41:17,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:17,147 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 300 flow [2022-12-13 13:41:17,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:17,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:17,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 300 flow [2022-12-13 13:41:17,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 300 flow [2022-12-13 13:41:17,180 INFO L130 PetriNetUnfolder]: 18/126 cut-off events. [2022-12-13 13:41:17,180 INFO L131 PetriNetUnfolder]: For 235/241 co-relation queries the response was YES. [2022-12-13 13:41:17,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 126 events. 18/126 cut-off events. For 235/241 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 685 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 309. Up to 21 conditions per place. [2022-12-13 13:41:17,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 300 flow [2022-12-13 13:41:17,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 13:41:19,279 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:19,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2133 [2022-12-13 13:41:19,280 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 296 flow [2022-12-13 13:41:19,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:19,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:19,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:19,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:41:19,281 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:41:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 464003567, now seen corresponding path program 1 times [2022-12-13 13:41:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:19,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105985114] [2022-12-13 13:41:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:19,445 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:41:19,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:19,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105985114] [2022-12-13 13:41:19,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105985114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:19,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:19,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678196201] [2022-12-13 13:41:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:19,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:19,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:41:19,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 296 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:41:19,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:19,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:41:19,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:19,628 INFO L130 PetriNetUnfolder]: 201/414 cut-off events. [2022-12-13 13:41:19,628 INFO L131 PetriNetUnfolder]: For 1360/1360 co-relation queries the response was YES. [2022-12-13 13:41:19,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 414 events. 201/414 cut-off events. For 1360/1360 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1887 event pairs, 102 based on Foata normal form. 8/399 useless extension candidates. Maximal degree in co-relation 1508. Up to 312 conditions per place. [2022-12-13 13:41:19,631 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-13 13:41:19,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 452 flow [2022-12-13 13:41:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 13:41:19,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 13:41:19,632 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 296 flow. Second operand 4 states and 42 transitions. [2022-12-13 13:41:19,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 452 flow [2022-12-13 13:41:19,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 434 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:19,636 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 310 flow [2022-12-13 13:41:19,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-13 13:41:19,637 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 13:41:19,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:19,637 INFO L89 Accepts]: Start accepts. Operand has 50 places, 41 transitions, 310 flow [2022-12-13 13:41:19,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:19,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:19,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 310 flow [2022-12-13 13:41:19,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 310 flow [2022-12-13 13:41:19,653 INFO L130 PetriNetUnfolder]: 18/127 cut-off events. [2022-12-13 13:41:19,653 INFO L131 PetriNetUnfolder]: For 261/267 co-relation queries the response was YES. [2022-12-13 13:41:19,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 127 events. 18/127 cut-off events. For 261/267 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 693 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 292. Up to 21 conditions per place. [2022-12-13 13:41:19,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 310 flow [2022-12-13 13:41:19,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 13:41:19,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [802] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_205| v_~f~0.base_163))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_163 (* v_~x2~0_294 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_163 (* .cse7 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_163 (* .cse5 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_163 (* .cse8 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_163 (* 4 .cse2))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_163 (* .cse3 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_163 (* .cse1 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_163 (* .cse4 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_147)) 1 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_239|) (not (= (ite (and (< .cse1 v_~size~0_147) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_147)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_147)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_147)) 1 0) 0)) (< 6 (mod (+ 4294967294 v_~n~0_133) 4294967296)) (not (= (ite (and (< .cse5 v_~size~0_147) (<= 0 .cse5)) 1 0) 0)) (= v_~x2~0_292 (select .cse6 (+ v_~f~0.offset_163 (* .cse0 4)))) (not (= (ite (and (< .cse7 v_~size~0_147) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_147) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_294) (< v_~x2~0_294 v_~size~0_147)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_294, ~size~0=v_~size~0_147, ~f~0.base=v_~f~0.base_163, #memory_int=|v_#memory_int_205|, ~n~0=v_~n~0_133, ~f~0.offset=v_~f~0.offset_163} OutVars{~x2~0=v_~x2~0_292, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_57|, ~size~0=v_~size~0_147, ~f~0.base=v_~f~0.base_163, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_239|, ~f~0.offset=v_~f~0.offset_163, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_55|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_67|, ~n~0=v_~n~0_133, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:41:21,923 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:41:21,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2286 [2022-12-13 13:41:21,923 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 330 flow [2022-12-13 13:41:21,923 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:41:21,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:21,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:21,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:41:21,924 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:41:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1705263883, now seen corresponding path program 1 times [2022-12-13 13:41:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:21,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213406440] [2022-12-13 13:41:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:22,049 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:41:22,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:22,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213406440] [2022-12-13 13:41:22,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213406440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:22,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:22,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817626121] [2022-12-13 13:41:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:22,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:22,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:22,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:22,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:22,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:22,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:22,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:22,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:22,184 INFO L130 PetriNetUnfolder]: 204/423 cut-off events. [2022-12-13 13:41:22,184 INFO L131 PetriNetUnfolder]: For 1563/1563 co-relation queries the response was YES. [2022-12-13 13:41:22,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 423 events. 204/423 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1949 event pairs, 122 based on Foata normal form. 4/404 useless extension candidates. Maximal degree in co-relation 1487. Up to 419 conditions per place. [2022-12-13 13:41:22,187 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 42 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-13 13:41:22,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 409 flow [2022-12-13 13:41:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-13 13:41:22,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2022-12-13 13:41:22,188 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 330 flow. Second operand 3 states and 33 transitions. [2022-12-13 13:41:22,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 409 flow [2022-12-13 13:41:22,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 385 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:22,192 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 300 flow [2022-12-13 13:41:22,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-13 13:41:22,193 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 13:41:22,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:22,193 INFO L89 Accepts]: Start accepts. Operand has 50 places, 41 transitions, 300 flow [2022-12-13 13:41:22,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:22,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:22,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 300 flow [2022-12-13 13:41:22,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 300 flow [2022-12-13 13:41:22,209 INFO L130 PetriNetUnfolder]: 17/130 cut-off events. [2022-12-13 13:41:22,209 INFO L131 PetriNetUnfolder]: For 234/240 co-relation queries the response was YES. [2022-12-13 13:41:22,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 130 events. 17/130 cut-off events. For 234/240 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 732 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 313. Up to 21 conditions per place. [2022-12-13 13:41:22,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 300 flow [2022-12-13 13:41:22,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 13:41:25,100 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:25,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2908 [2022-12-13 13:41:25,101 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 296 flow [2022-12-13 13:41:25,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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:41:25,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:25,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:25,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:41:25,102 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:41:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -606369209, now seen corresponding path program 1 times [2022-12-13 13:41:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:25,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624426766] [2022-12-13 13:41:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:25,493 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:41:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624426766] [2022-12-13 13:41:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624426766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:25,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847845602] [2022-12-13 13:41:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:25,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:25,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:41:25,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 296 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:41:25,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:25,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:41:25,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:25,955 INFO L130 PetriNetUnfolder]: 412/832 cut-off events. [2022-12-13 13:41:25,955 INFO L131 PetriNetUnfolder]: For 2802/2802 co-relation queries the response was YES. [2022-12-13 13:41:25,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 832 events. 412/832 cut-off events. For 2802/2802 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4589 event pairs, 151 based on Foata normal form. 15/793 useless extension candidates. Maximal degree in co-relation 3032. Up to 403 conditions per place. [2022-12-13 13:41:25,960 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 41 selfloop transitions, 15 changer transitions 44/100 dead transitions. [2022-12-13 13:41:25,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 881 flow [2022-12-13 13:41:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:41:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:41:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-12-13 13:41:25,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2022-12-13 13:41:25,961 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 296 flow. Second operand 7 states and 90 transitions. [2022-12-13 13:41:25,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 881 flow [2022-12-13 13:41:25,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 853 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:25,968 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 388 flow [2022-12-13 13:41:25,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-12-13 13:41:25,968 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 13:41:25,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:25,968 INFO L89 Accepts]: Start accepts. Operand has 56 places, 46 transitions, 388 flow [2022-12-13 13:41:25,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:25,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:25,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 46 transitions, 388 flow [2022-12-13 13:41:25,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 388 flow [2022-12-13 13:41:26,003 INFO L130 PetriNetUnfolder]: 23/149 cut-off events. [2022-12-13 13:41:26,003 INFO L131 PetriNetUnfolder]: For 388/405 co-relation queries the response was YES. [2022-12-13 13:41:26,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 149 events. 23/149 cut-off events. For 388/405 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 824 event pairs, 1 based on Foata normal form. 1/139 useless extension candidates. Maximal degree in co-relation 374. Up to 22 conditions per place. [2022-12-13 13:41:26,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 388 flow [2022-12-13 13:41:26,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 13:41:26,005 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:41:26,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 13:41:26,005 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 388 flow [2022-12-13 13:41:26,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:41:26,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:26,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:26,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:41:26,006 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:41:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1862093416, now seen corresponding path program 1 times [2022-12-13 13:41:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:26,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936657410] [2022-12-13 13:41:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:26,125 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:41:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:26,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936657410] [2022-12-13 13:41:26,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936657410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:26,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:26,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128078601] [2022-12-13 13:41:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:26,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:41:26,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 388 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:41:26,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:26,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:41:26,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:26,300 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:41:26,300 INFO L131 PetriNetUnfolder]: For 1545/1545 co-relation queries the response was YES. [2022-12-13 13:41:26,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 459 events. 220/459 cut-off events. For 1545/1545 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2169 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1732. Up to 330 conditions per place. [2022-12-13 13:41:26,303 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:41:26,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 556 flow [2022-12-13 13:41:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 13:41:26,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 13:41:26,304 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 388 flow. Second operand 4 states and 42 transitions. [2022-12-13 13:41:26,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 556 flow [2022-12-13 13:41:26,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:26,309 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:26,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:41:26,309 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:41:26,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:26,309 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:26,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:26,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:26,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:26,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:26,327 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:41:26,328 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:41:26,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 856 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:41:26,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:26,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:28,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:28,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1919 [2022-12-13 13:41:28,228 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:41:28,228 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:41:28,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:28,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:28,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:41:28,229 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:41:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash 125256077, now seen corresponding path program 1 times [2022-12-13 13:41:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804958798] [2022-12-13 13:41:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:28,344 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:41:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:28,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804958798] [2022-12-13 13:41:28,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804958798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:28,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:28,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658693745] [2022-12-13 13:41:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:28,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:28,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:28,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:41:28,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:28,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:28,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:28,482 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:41:28,482 INFO L131 PetriNetUnfolder]: For 2039/2039 co-relation queries the response was YES. [2022-12-13 13:41:28,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2039/2039 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2105 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:41:28,485 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:41:28,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:41:28,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:41:28,486 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:41:28,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:28,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:28,492 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:28,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:41:28,492 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:41:28,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:28,493 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:28,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:28,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:28,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:28,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:28,513 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:41:28,513 INFO L131 PetriNetUnfolder]: For 466/498 co-relation queries the response was YES. [2022-12-13 13:41:28,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 466/498 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 861 event pairs, 1 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:41:28,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:28,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:32,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:32,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3547 [2022-12-13 13:41:32,039 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:41:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:41:32,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:32,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:32,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:41:32,040 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:41:32,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 695032772, now seen corresponding path program 1 times [2022-12-13 13:41:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:32,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262210623] [2022-12-13 13:41:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:32,167 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:41:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:32,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262210623] [2022-12-13 13:41:32,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262210623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:32,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:32,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198139270] [2022-12-13 13:41:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:32,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:32,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:32,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:32,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:32,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:41:32,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:32,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:32,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:32,355 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:41:32,356 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:41:32,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2172 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:41:32,359 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:41:32,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:41:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:41:32,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:41:32,360 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:41:32,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:41:32,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:32,364 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:32,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:41:32,365 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:41:32,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:32,365 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:32,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:32,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:32,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:32,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:32,384 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:41:32,384 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:41:32,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 856 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:41:32,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:32,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:35,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:35,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2797 [2022-12-13 13:41:35,162 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:41:35,162 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:41:35,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:35,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:35,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:41:35,162 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:41:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 297030983, now seen corresponding path program 1 times [2022-12-13 13:41:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:35,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272367854] [2022-12-13 13:41:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:35,278 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:41:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:35,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272367854] [2022-12-13 13:41:35,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272367854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:35,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:35,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303624573] [2022-12-13 13:41:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:35,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:35,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:41:35,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:35,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:35,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:35,426 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:41:35,426 INFO L131 PetriNetUnfolder]: For 2030/2030 co-relation queries the response was YES. [2022-12-13 13:41:35,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2030/2030 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2105 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:41:35,429 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:41:35,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:41:35,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:41:35,430 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:41:35,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:35,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:35,436 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:35,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:41:35,437 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:41:35,437 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:35,437 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:35,437 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:35,437 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:35,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:35,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:35,457 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:41:35,457 INFO L131 PetriNetUnfolder]: For 401/420 co-relation queries the response was YES. [2022-12-13 13:41:35,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 401/420 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 863 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:41:35,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:35,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:40,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:40,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5284 [2022-12-13 13:41:40,721 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:41:40,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:41:40,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:40,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:40,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:41:40,722 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:41:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash 866807678, now seen corresponding path program 1 times [2022-12-13 13:41:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:40,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934452088] [2022-12-13 13:41:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:40,846 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:41:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:40,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934452088] [2022-12-13 13:41:40,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934452088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:40,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:40,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687155051] [2022-12-13 13:41:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:40,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:40,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:40,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:41:40,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:40,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:40,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:41,039 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:41:41,039 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:41:41,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2166 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:41:41,042 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:41:41,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:41:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:41:41,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:41:41,043 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:41:41,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:41:41,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:41,048 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:41,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:41:41,049 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:41:41,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:41,049 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:41,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:41,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:41,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:41,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:41,069 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:41:41,069 INFO L131 PetriNetUnfolder]: For 438/457 co-relation queries the response was YES. [2022-12-13 13:41:41,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 438/457 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 852 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:41:41,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:41,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:45,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:45,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4186 [2022-12-13 13:41:45,235 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:41:45,235 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:41:45,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:45,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:45,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:41:45,235 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:41:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash 468805889, now seen corresponding path program 1 times [2022-12-13 13:41:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:45,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309375464] [2022-12-13 13:41:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:45,380 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:41:45,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:45,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309375464] [2022-12-13 13:41:45,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309375464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:45,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637413790] [2022-12-13 13:41:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:45,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:45,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:45,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:45,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:41:45,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:45,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:45,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:45,526 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:41:45,526 INFO L131 PetriNetUnfolder]: For 2030/2030 co-relation queries the response was YES. [2022-12-13 13:41:45,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2030/2030 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2108 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:41:45,529 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:41:45,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:41:45,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:41:45,530 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:41:45,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:45,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:45,536 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:45,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:41:45,536 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:41:45,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:45,536 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:45,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:45,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:45,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:45,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:45,563 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:41:45,564 INFO L131 PetriNetUnfolder]: For 405/424 co-relation queries the response was YES. [2022-12-13 13:41:45,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 405/424 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 856 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:41:45,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:45,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:52,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:52,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7119 [2022-12-13 13:41:52,655 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:41:52,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:41:52,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:52,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:52,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:41:52,656 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:41:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1038582584, now seen corresponding path program 1 times [2022-12-13 13:41:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410672295] [2022-12-13 13:41:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:52,780 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:41:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:52,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410672295] [2022-12-13 13:41:52,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410672295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:52,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:52,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213537479] [2022-12-13 13:41:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:52,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:52,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:52,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:52,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:52,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:41:52,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:52,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:52,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:52,971 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:41:52,971 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:41:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2170 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:41:52,974 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:41:52,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:41:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:41:52,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:41:52,976 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:41:52,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:41:52,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:52,983 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:52,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:41:52,984 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:41:52,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:52,984 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:52,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:52,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:52,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:52,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:53,004 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:41:53,005 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:41:53,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 862 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:41:53,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:41:53,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:41:58,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:41:58,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5656 [2022-12-13 13:41:58,640 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:41:58,641 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:41:58,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:58,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:58,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:41:58,641 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:41:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash 640580795, now seen corresponding path program 1 times [2022-12-13 13:41:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:58,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640678629] [2022-12-13 13:41:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:58,771 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:41:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:58,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640678629] [2022-12-13 13:41:58,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640678629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:58,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:58,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602506427] [2022-12-13 13:41:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:58,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:58,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:41:58,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:41:58,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:58,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:41:58,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:58,922 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:41:58,923 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 13:41:58,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2121 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:41:58,925 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:41:58,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:41:58,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:41:58,926 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:41:58,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:41:58,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:58,931 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:58,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:41:58,932 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:41:58,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:58,932 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:58,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:58,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:58,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:58,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:58,952 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:41:58,952 INFO L131 PetriNetUnfolder]: For 402/420 co-relation queries the response was YES. [2022-12-13 13:41:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 402/420 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 868 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:41:58,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:41:58,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:42:09,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:42:09,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10180 [2022-12-13 13:42:09,112 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:42:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:42:09,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:09,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:09,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:42:09,112 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:42:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -97895396, now seen corresponding path program 1 times [2022-12-13 13:42:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:09,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360546425] [2022-12-13 13:42:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:09,246 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:42:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360546425] [2022-12-13 13:42:09,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360546425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:09,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:09,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369552852] [2022-12-13 13:42:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:09,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:42:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:09,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:42:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:42:09,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:42:09,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:42:09,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:09,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:42:09,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:09,441 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:42:09,442 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:42:09,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2173 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:42:09,445 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:42:09,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:42:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:42:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:42:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:42:09,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:42:09,446 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:42:09,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:42:09,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:42:09,450 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:09,450 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:42:09,454 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:42:09,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:09,454 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:09,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:09,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:09,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:09,473 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:42:09,473 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:42:09,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 863 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:42:09,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:09,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:42:19,012 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:42:19,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9559 [2022-12-13 13:42:19,013 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:42:19,013 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:42:19,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:19,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:19,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 13:42:19,014 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:42:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash 812355701, now seen corresponding path program 1 times [2022-12-13 13:42:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:19,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910425618] [2022-12-13 13:42:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:19,125 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:42:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:19,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910425618] [2022-12-13 13:42:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910425618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:19,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:19,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:42:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453971820] [2022-12-13 13:42:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:19,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:42:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:42:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:42:19,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:42:19,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:42:19,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:19,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:42:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:19,284 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:42:19,284 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 13:42:19,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2110 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:42:19,287 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:42:19,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:42:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:42:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:42:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:42:19,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:42:19,288 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:42:19,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:42:19,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:42:19,293 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:19,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:42:19,294 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:42:19,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:19,294 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:19,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:19,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:19,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:19,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:19,313 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:42:19,314 INFO L131 PetriNetUnfolder]: For 397/415 co-relation queries the response was YES. [2022-12-13 13:42:19,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 397/415 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 866 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:42:19,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:19,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:42:27,209 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 397 DAG size of output: 392 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:42:35,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:42:35,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16545 [2022-12-13 13:42:35,839 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:42:35,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:42:35,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:35,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:35,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 13:42:35,839 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:42:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 73879510, now seen corresponding path program 1 times [2022-12-13 13:42:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103524803] [2022-12-13 13:42:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:35,973 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:42:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103524803] [2022-12-13 13:42:35,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103524803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:35,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:35,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173437757] [2022-12-13 13:42:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:42:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:42:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:42:35,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:42:35,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:42:35,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:35,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:42:35,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:36,185 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:42:36,185 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:42:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2165 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:42:36,188 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:42:36,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:42:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:42:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:42:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:42:36,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:42:36,189 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:42:36,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:42:36,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:42:36,194 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:36,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:42:36,195 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:42:36,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:36,195 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:36,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:36,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:36,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:36,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:36,215 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:42:36,215 INFO L131 PetriNetUnfolder]: For 440/459 co-relation queries the response was YES. [2022-12-13 13:42:36,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 440/459 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 863 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:42:36,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:42:36,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:42:49,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:42:49,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13731 [2022-12-13 13:42:49,926 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:42:49,926 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:42:49,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:49,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:49,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 13:42:49,926 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:42:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 984130607, now seen corresponding path program 1 times [2022-12-13 13:42:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:49,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007923033] [2022-12-13 13:42:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:50,034 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:42:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007923033] [2022-12-13 13:42:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007923033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:50,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:50,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:42:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963148668] [2022-12-13 13:42:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:50,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:42:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:42:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:42:50,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:42:50,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:42:50,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:50,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:42:50,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:50,166 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:42:50,167 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 13:42:50,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2105 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:42:50,170 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:42:50,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:42:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:42:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:42:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:42:50,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:42:50,171 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:42:50,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:42:50,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:42:50,175 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:50,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:42:50,176 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:42:50,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:50,176 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:50,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:50,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:50,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:50,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:50,196 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:42:50,196 INFO L131 PetriNetUnfolder]: For 397/415 co-relation queries the response was YES. [2022-12-13 13:42:50,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 397/415 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 870 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:42:50,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:42:50,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:42:55,831 WARN L233 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 424 DAG size of output: 419 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:43:03,271 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:43:05,771 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:43:05,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15600 [2022-12-13 13:43:05,776 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:43:05,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:43:05,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:43:05,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:05,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 13:43:05,777 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:43:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash 245654416, now seen corresponding path program 1 times [2022-12-13 13:43:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:05,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320703999] [2022-12-13 13:43:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:05,910 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:43:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:05,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320703999] [2022-12-13 13:43:05,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320703999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:05,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:43:05,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:43:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491175322] [2022-12-13 13:43:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:05,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:43:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:05,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:43:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:43:05,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:43:05,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:43:05,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:43:05,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:43:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:06,130 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:43:06,130 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:43:06,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2171 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:43:06,133 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:43:06,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:43:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:43:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:43:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:43:06,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:43:06,135 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:43:06,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:43:06,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:43:06,140 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:43:06,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:43:06,141 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:43:06,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:43:06,141 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:43:06,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:43:06,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:43:06,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:43:06,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:43:06,163 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:43:06,164 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:43:06,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 863 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:43:06,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:43:06,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:43:13,068 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 335 DAG size of output: 333 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:43:29,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:43:29,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23482 [2022-12-13 13:43:29,623 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:43:29,624 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:43:29,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:43:29,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:29,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 13:43:29,626 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:43:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1155905513, now seen corresponding path program 1 times [2022-12-13 13:43:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925361593] [2022-12-13 13:43:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:29,784 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:43:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925361593] [2022-12-13 13:43:29,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925361593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:29,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:43:29,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:43:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574534384] [2022-12-13 13:43:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:29,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:43:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:43:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:43:29,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:43:29,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:43:29,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:43:29,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:43:29,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:29,974 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:43:29,975 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 13:43:29,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2107 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:43:29,978 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:43:29,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:43:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:43:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:43:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:43:29,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:43:29,979 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:43:29,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:43:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:43:29,983 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:43:29,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:43:29,985 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:43:29,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:43:29,986 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:43:29,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:43:29,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:43:29,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:43:29,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:43:30,005 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:43:30,006 INFO L131 PetriNetUnfolder]: For 401/419 co-relation queries the response was YES. [2022-12-13 13:43:30,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 401/419 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 866 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:43:30,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:43:30,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:43:42,304 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 451 DAG size of output: 446 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:43:59,063 WARN L233 SmtUtils]: Spent 14.13s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:44:03,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:44:03,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33172 [2022-12-13 13:44:03,157 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:44:03,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:44:03,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:03,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 13:44:03,157 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:44:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 417429322, now seen corresponding path program 1 times [2022-12-13 13:44:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100177520] [2022-12-13 13:44:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:03,283 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:44:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100177520] [2022-12-13 13:44:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100177520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:44:03,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:44:03,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:44:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458436705] [2022-12-13 13:44:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:44:03,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:44:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:03,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:44:03,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:44:03,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:44:03,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:44:03,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:03,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:44:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:03,508 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:44:03,509 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:44:03,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2167 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:44:03,517 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:44:03,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:44:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:44:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:44:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:44:03,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:44:03,518 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:44:03,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:44:03,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:44:03,522 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:44:03,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:44:03,523 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:44:03,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:44:03,523 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:44:03,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:44:03,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:44:03,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:44:03,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:44:03,549 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:44:03,549 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:44:03,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 861 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:44:03,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:44:03,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:44:16,271 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 470 DAG size of output: 468 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:44:33,929 WARN L233 SmtUtils]: Spent 7.50s on a formula simplification. DAG size of input: 472 DAG size of output: 468 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:44:37,232 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:44:37,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33710 [2022-12-13 13:44:37,233 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:44:37,233 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:44:37,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:37,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:37,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 13:44:37,233 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:44:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1327680419, now seen corresponding path program 1 times [2022-12-13 13:44:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:37,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712599209] [2022-12-13 13:44:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:37,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:37,361 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:44:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:37,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712599209] [2022-12-13 13:44:37,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712599209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:44:37,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:44:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:44:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938842489] [2022-12-13 13:44:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:44:37,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:44:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:37,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:44:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:44:37,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:44:37,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:44:37,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:37,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:44:37,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:37,527 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:44:37,527 INFO L131 PetriNetUnfolder]: For 2039/2039 co-relation queries the response was YES. [2022-12-13 13:44:37,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2039/2039 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2098 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:44:37,531 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:44:37,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:44:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:44:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:44:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:44:37,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:44:37,533 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:44:37,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:44:37,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:44:37,538 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:44:37,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:44:37,538 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:44:37,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:44:37,538 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:44:37,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:44:37,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:44:37,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:44:37,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:44:37,563 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:44:37,563 INFO L131 PetriNetUnfolder]: For 469/501 co-relation queries the response was YES. [2022-12-13 13:44:37,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 469/501 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 863 event pairs, 1 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:44:37,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:44:37,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:44:47,466 WARN L233 SmtUtils]: Spent 9.89s on a formula simplification. DAG size of input: 478 DAG size of output: 473 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:45:01,191 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:45:08,184 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 610 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:45:08,186 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:45:08,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30648 [2022-12-13 13:45:08,186 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:45:08,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:45:08,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:08,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:08,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 13:45:08,187 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:45:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1897457114, now seen corresponding path program 1 times [2022-12-13 13:45:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:08,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685088154] [2022-12-13 13:45:08,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:08,328 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:45:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:08,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685088154] [2022-12-13 13:45:08,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685088154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:08,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:08,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:45:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055064128] [2022-12-13 13:45:08,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:08,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:45:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:08,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:45:08,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:45:08,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:45:08,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:45:08,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:08,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:45:08,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:08,542 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:45:08,542 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:45:08,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2172 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:45:08,544 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:45:08,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:45:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:45:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:45:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:45:08,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:45:08,545 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:45:08,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:45:08,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:45:08,548 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:45:08,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:45:08,548 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:45:08,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:45:08,549 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:45:08,549 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:45:08,549 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:45:08,549 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:45:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:45:08,567 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:45:08,568 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:45:08,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 860 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:45:08,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:45:08,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:45:18,651 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 377 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:45:24,727 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 506 DAG size of output: 504 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:45:35,630 WARN L233 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 389 DAG size of output: 387 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:45:45,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:45:45,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37186 [2022-12-13 13:45:45,734 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:45:45,734 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:45:45,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:45,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:45,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 13:45:45,735 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:45:45,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1499455325, now seen corresponding path program 1 times [2022-12-13 13:45:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:45,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321614688] [2022-12-13 13:45:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:45,881 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:45:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:45,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321614688] [2022-12-13 13:45:45,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321614688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:45,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:45,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:45:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610389750] [2022-12-13 13:45:45,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:45,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:45:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:45:45,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:45:45,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:45:45,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:45:45,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:45,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:45:45,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:46,071 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:45:46,071 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 13:45:46,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2110 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:45:46,074 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:45:46,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:45:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:45:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:45:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:45:46,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:45:46,075 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:45:46,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:45:46,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:45:46,080 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:45:46,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:45:46,081 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:45:46,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:45:46,081 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:45:46,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:45:46,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:45:46,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:45:46,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:45:46,102 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:45:46,102 INFO L131 PetriNetUnfolder]: For 397/415 co-relation queries the response was YES. [2022-12-13 13:45:46,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 397/415 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 863 event pairs, 1 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:45:46,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:45:46,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:45:59,491 WARN L233 SmtUtils]: Spent 13.38s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:46:09,175 WARN L233 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 490 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:46:19,622 WARN L233 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:46:27,153 WARN L233 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:46:27,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:46:27,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41075 [2022-12-13 13:46:27,156 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:46:27,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:46:27,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:46:27,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:46:27,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 13:46:27,156 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:46:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:46:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2069232020, now seen corresponding path program 1 times [2022-12-13 13:46:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:46:27,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361723943] [2022-12-13 13:46:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:46:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:46:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:46:27,281 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:46:27,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:46:27,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361723943] [2022-12-13 13:46:27,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361723943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:46:27,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:46:27,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:46:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761564370] [2022-12-13 13:46:27,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:46:27,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:46:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:46:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:46:27,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:46:27,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:46:27,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:46:27,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:46:27,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:46:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:46:27,452 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:46:27,452 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:46:27,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2172 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:46:27,455 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:46:27,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:46:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:46:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:46:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:46:27,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:46:27,456 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:46:27,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:46:27,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:46:27,460 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:46:27,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:46:27,461 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:46:27,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:46:27,461 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:46:27,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:46:27,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:46:27,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:46:27,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:46:27,485 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:46:27,485 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:46:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 862 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:46:27,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:46:27,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:46:40,223 WARN L233 SmtUtils]: Spent 12.73s on a formula simplification. DAG size of input: 416 DAG size of output: 414 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:46:48,608 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 406 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:46:55,628 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 544 DAG size of output: 540 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:47:05,120 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification that was a NOOP. DAG size: 532 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:47:15,406 WARN L233 SmtUtils]: Spent 10.28s on a formula simplification. DAG size of input: 416 DAG size of output: 414 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:47:40,903 WARN L233 SmtUtils]: Spent 21.17s on a formula simplification. DAG size of input: 544 DAG size of output: 540 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:47:44,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:47:44,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76663 [2022-12-13 13:47:44,124 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:47:44,125 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:47:44,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:44,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:44,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 13:47:44,125 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:47:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1671230231, now seen corresponding path program 1 times [2022-12-13 13:47:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:44,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008474050] [2022-12-13 13:47:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:44,246 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:47:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:44,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008474050] [2022-12-13 13:47:44,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008474050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:44,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:44,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:47:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19301093] [2022-12-13 13:47:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:44,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:44,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:47:44,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:47:44,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:44,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:47:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:44,436 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:47:44,436 INFO L131 PetriNetUnfolder]: For 2033/2033 co-relation queries the response was YES. [2022-12-13 13:47:44,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2033/2033 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2097 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:47:44,438 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:47:44,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:47:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:47:44,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:47:44,440 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:47:44,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:47:44,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:47:44,444 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:47:44,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:47:44,445 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:47:44,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:47:44,445 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:47:44,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:47:44,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:47:44,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:47:44,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:47:44,465 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:47:44,465 INFO L131 PetriNetUnfolder]: For 465/496 co-relation queries the response was YES. [2022-12-13 13:47:44,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 465/496 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 864 event pairs, 1 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:47:44,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:47:44,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:48:07,599 WARN L233 SmtUtils]: Spent 23.12s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:48:20,697 WARN L233 SmtUtils]: Spent 13.09s on a formula simplification that was a NOOP. DAG size: 517 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:48:45,032 WARN L233 SmtUtils]: Spent 24.33s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:48:52,195 WARN L233 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:48:52,197 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:48:52,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67753 [2022-12-13 13:48:52,198 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:48:52,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:48:52,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:52,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:52,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 13:48:52,198 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:48:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1471975370, now seen corresponding path program 1 times [2022-12-13 13:48:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:52,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98446021] [2022-12-13 13:48:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:52,330 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:48:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:52,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98446021] [2022-12-13 13:48:52,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98446021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:52,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:52,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:48:52,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698871657] [2022-12-13 13:48:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:52,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:48:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:52,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:48:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:48:52,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:48:52,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:48:52,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:52,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:48:52,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:52,529 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:48:52,529 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:48:52,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2171 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:48:52,532 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:48:52,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:48:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:48:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:48:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:48:52,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:48:52,533 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:48:52,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:48:52,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:48:52,537 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:48:52,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:48:52,538 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:48:52,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:52,538 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:48:52,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:52,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:52,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:48:52,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:48:52,559 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:48:52,559 INFO L131 PetriNetUnfolder]: For 439/458 co-relation queries the response was YES. [2022-12-13 13:48:52,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 439/458 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 847 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:48:52,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:48:52,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:49:00,897 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 445 DAG size of output: 441 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:49:33,195 WARN L233 SmtUtils]: Spent 28.27s on a formula simplification. DAG size of input: 580 DAG size of output: 576 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:50:09,600 WARN L233 SmtUtils]: Spent 32.15s on a formula simplification. DAG size of input: 443 DAG size of output: 441 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:50:21,854 WARN L233 SmtUtils]: Spent 12.25s on a formula simplification that was a NOOP. DAG size: 433 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:50:37,603 WARN L233 SmtUtils]: Spent 15.75s on a formula simplification. DAG size of input: 578 DAG size of output: 576 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:50:42,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:50:42,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109487 [2022-12-13 13:50:42,025 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:50:42,026 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:50:42,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:50:42,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:50:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 13:50:42,026 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:50:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:50:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1843005137, now seen corresponding path program 1 times [2022-12-13 13:50:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:50:42,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157114887] [2022-12-13 13:50:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:50:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:42,144 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:50:42,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:50:42,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157114887] [2022-12-13 13:50:42,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157114887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:50:42,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:50:42,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:50:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942332775] [2022-12-13 13:50:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:50:42,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:50:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:50:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:50:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:50:42,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:50:42,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:50:42,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:50:42,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:50:42,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:50:42,317 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:50:42,317 INFO L131 PetriNetUnfolder]: For 2033/2033 co-relation queries the response was YES. [2022-12-13 13:50:42,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2033/2033 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2097 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:50:42,319 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:50:42,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:50:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:50:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:50:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:50:42,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:50:42,322 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:50:42,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:50:42,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:50:42,327 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:50:42,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:50:42,327 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:50:42,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:50:42,327 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:50:42,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:50:42,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:50:42,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:50:42,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:50:42,348 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:50:42,349 INFO L131 PetriNetUnfolder]: For 462/493 co-relation queries the response was YES. [2022-12-13 13:50:42,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 462/493 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 860 event pairs, 1 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:50:42,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:50:42,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:50:58,186 WARN L233 SmtUtils]: Spent 15.82s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:51:06,182 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 544 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:51:37,375 WARN L233 SmtUtils]: Spent 31.19s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:51:48,276 WARN L233 SmtUtils]: Spent 10.89s on a formula simplification that was a NOOP. DAG size: 718 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:51:48,278 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:51:48,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65951 [2022-12-13 13:51:48,278 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 370 flow [2022-12-13 13:51:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:51:48,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:48,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:48,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 13:51:48,279 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:51:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1300200464, now seen corresponding path program 1 times [2022-12-13 13:51:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335595715] [2022-12-13 13:51:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:48,413 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:51:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:48,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335595715] [2022-12-13 13:51:48,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335595715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:51:48,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:51:48,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:51:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217253077] [2022-12-13 13:51:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:51:48,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:51:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:51:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:51:48,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:51:48,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 370 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:51:48,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:48,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:51:48,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:48,651 INFO L130 PetriNetUnfolder]: 220/459 cut-off events. [2022-12-13 13:51:48,651 INFO L131 PetriNetUnfolder]: For 1749/1749 co-relation queries the response was YES. [2022-12-13 13:51:48,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 459 events. 220/459 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2168 event pairs, 100 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2022-12-13 13:51:48,654 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 13:51:48,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 540 flow [2022-12-13 13:51:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:51:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:51:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 13:51:48,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 13:51:48,655 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 370 flow. Second operand 4 states and 43 transitions. [2022-12-13 13:51:48,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 540 flow [2022-12-13 13:51:48,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 522 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:51:48,659 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 389 flow [2022-12-13 13:51:48,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:51:48,659 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 13:51:48,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:48,660 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:51:48,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:48,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:48,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:51:48,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 389 flow [2022-12-13 13:51:48,681 INFO L130 PetriNetUnfolder]: 23/151 cut-off events. [2022-12-13 13:51:48,681 INFO L131 PetriNetUnfolder]: For 440/459 co-relation queries the response was YES. [2022-12-13 13:51:48,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 151 events. 23/151 cut-off events. For 440/459 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 859 event pairs, 1 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 357. Up to 23 conditions per place. [2022-12-13 13:51:48,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 389 flow [2022-12-13 13:51:48,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 13:52:13,232 WARN L233 SmtUtils]: Spent 24.54s on a formula simplification. DAG size of input: 472 DAG size of output: 468 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:52:56,836 WARN L233 SmtUtils]: Spent 39.39s on a formula simplification. DAG size of input: 616 DAG size of output: 612 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:53:19,919 WARN L233 SmtUtils]: Spent 23.08s on a formula simplification that was a NOOP. DAG size: 602 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:53:39,476 WARN L233 SmtUtils]: Spent 19.55s on a formula simplification. DAG size of input: 472 DAG size of output: 468 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:54:04,200 WARN L233 SmtUtils]: Spent 24.72s on a formula simplification that was a NOOP. DAG size: 458 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:54:33,120 WARN L233 SmtUtils]: Spent 28.92s on a formula simplification. DAG size of input: 616 DAG size of output: 612 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:54:37,859 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:54:37,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169201 [2022-12-13 13:54:37,860 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 390 flow [2022-12-13 13:54:37,860 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:54:37,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:54:37,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:54:37,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 13:54:37,861 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:54:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:54:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2014780043, now seen corresponding path program 1 times [2022-12-13 13:54:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:54:37,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369891476] [2022-12-13 13:54:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:54:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:54:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:54:37,994 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:54:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:54:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369891476] [2022-12-13 13:54:37,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369891476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:54:37,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:54:37,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:54:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402173212] [2022-12-13 13:54:37,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:54:37,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:54:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:54:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:54:37,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:54:37,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:54:37,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 390 flow. Second operand has 3 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:54:37,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:54:37,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:54:37,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:54:38,154 INFO L130 PetriNetUnfolder]: 217/452 cut-off events. [2022-12-13 13:54:38,154 INFO L131 PetriNetUnfolder]: For 2039/2039 co-relation queries the response was YES. [2022-12-13 13:54:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 452 events. 217/452 cut-off events. For 2039/2039 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2110 event pairs, 121 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1652. Up to 448 conditions per place. [2022-12-13 13:54:38,156 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 13:54:38,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 505 flow [2022-12-13 13:54:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:54:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:54:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 13:54:38,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 13:54:38,162 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 390 flow. Second operand 3 states and 34 transitions. [2022-12-13 13:54:38,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 505 flow [2022-12-13 13:54:38,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 471 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:54:38,166 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-13 13:54:38,166 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 13:54:38,166 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-13 13:54:38,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:54:38,167 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:54:38,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:54:38,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:54:38,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:54:38,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 374 flow [2022-12-13 13:54:38,184 INFO L130 PetriNetUnfolder]: 23/152 cut-off events. [2022-12-13 13:54:38,184 INFO L131 PetriNetUnfolder]: For 466/498 co-relation queries the response was YES. [2022-12-13 13:54:38,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 152 events. 23/152 cut-off events. For 466/498 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 860 event pairs, 1 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 378. Up to 22 conditions per place. [2022-12-13 13:54:38,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 374 flow [2022-12-13 13:54:38,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 Received shutdown request... [2022-12-13 13:54:57,874 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:54:58,735 WARN L249 SmtUtils]: Removed 71 from assertion stack [2022-12-13 13:54:58,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 13:54:58,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 13:54:58,737 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 586 for 20534ms.. [2022-12-13 13:54:58,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 13:54:58,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 13:54:58,739 INFO L445 BasicCegarLoop]: Path program histogram: [3, 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] [2022-12-13 13:54:58,741 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:54:58,741 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:54:58,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:54:58 BasicIcfg [2022-12-13 13:54:58,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:54:58,744 INFO L158 Benchmark]: Toolchain (without parser) took 844482.65ms. Allocated memory was 172.0MB in the beginning and 431.0MB in the end (delta: 259.0MB). Free memory was 146.2MB in the beginning and 309.8MB in the end (delta: -163.6MB). Peak memory consumption was 304.1MB. Max. memory is 8.0GB. [2022-12-13 13:54:58,744 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:54:58,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.40ms. Allocated memory is still 172.0MB. Free memory was 146.0MB in the beginning and 134.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 13:54:58,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.10ms. Allocated memory is still 172.0MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:54:58,745 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 130.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 13:54:58,745 INFO L158 Benchmark]: RCFGBuilder took 578.41ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 144.8MB in the end (delta: -14.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2022-12-13 13:54:58,745 INFO L158 Benchmark]: TraceAbstraction took 843513.67ms. Allocated memory was 172.0MB in the beginning and 431.0MB in the end (delta: 259.0MB). Free memory was 143.8MB in the beginning and 309.8MB in the end (delta: -166.0MB). Peak memory consumption was 300.3MB. Max. memory is 8.0GB. [2022-12-13 13:54:58,746 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.40ms. Allocated memory is still 172.0MB. Free memory was 146.0MB in the beginning and 134.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.10ms. Allocated memory is still 172.0MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 130.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 578.41ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 144.8MB in the end (delta: -14.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * TraceAbstraction took 843513.67ms. Allocated memory was 172.0MB in the beginning and 431.0MB in the end (delta: 259.0MB). Free memory was 143.8MB in the beginning and 309.8MB in the end (delta: -166.0MB). Peak memory consumption was 300.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 170 PlacesBefore, 21 PlacesAfterwards, 181 TransitionsBefore, 17 TransitionsAfterwards, 4092 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 85 ConcurrentYvCompositions, 13 ChoiceCompositions, 162 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 2766, 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: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, 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: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, 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: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, 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: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, 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: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2768, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2535, unknown conditional: 0, unknown unconditional: 2535] , Statistics on independence cache: Total cache size (in pairs): 5095, Positive cache size: 5093, Positive conditional cache size: 0, Positive unconditional cache size: 5093, 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.9s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 3, 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: 15, independent: 15, independent conditional: 3, 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: 15, independent: 15, independent conditional: 3, 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: 9, independent: 9, independent conditional: 3, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 3, 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.1s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 7, independent: 0, independent conditional: 0, 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): 17, Positive cache size: 17, Positive conditional cache size: 10, Positive unconditional cache size: 7, 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.4s, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, 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.5s, 26 PlacesBefore, 26 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 3, independent unconditional: 6, 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: 3, independent unconditional: 6, 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: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 3, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 34, Positive conditional cache size: 13, Positive unconditional cache size: 21, 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.4s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 38, Positive conditional cache size: 15, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, 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, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, 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: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 43, Positive conditional cache size: 18, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, 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.6s, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, 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: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 46, Positive conditional cache size: 21, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, 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, 37 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 16, independent conditional: 5, independent unconditional: 11, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 31, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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.9s, 35 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, 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: 27, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 34, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 2.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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): 65, Positive cache size: 62, Positive conditional cache size: 34, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 1.2s, 42 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 132 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): 68, Positive cache size: 65, Positive conditional cache size: 37, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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, 44 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 138 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: 72, Positive conditional cache size: 42, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 1.4s, 44 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 138 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): 78, Positive cache size: 75, Positive conditional cache size: 45, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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, 46 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 40 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 3, independent conditional: 3, 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): 81, Positive cache size: 78, Positive conditional cache size: 48, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 2.1s, 49 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 160 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): 84, Positive cache size: 81, Positive conditional cache size: 51, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 2.3s, 50 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 15, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 97, Positive conditional cache size: 65, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 2.9s, 50 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 160 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): 103, Positive cache size: 100, Positive conditional cache size: 68, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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, 54 PlacesBefore, 54 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 166 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): 103, Positive cache size: 100, Positive conditional cache size: 68, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 114, Positive conditional cache size: 78, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 3.5s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 120, Positive cache size: 117, Positive conditional cache size: 81, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 2.8s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 131, Positive conditional cache size: 91, Positive unconditional cache size: 40, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 5.3s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 137, Positive cache size: 134, Positive conditional cache size: 94, Positive unconditional cache size: 40, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 4.2s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 148, Positive conditional cache size: 104, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 7.1s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 154, Positive cache size: 151, Positive conditional cache size: 107, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 5.6s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 165, Positive conditional cache size: 117, Positive unconditional cache size: 48, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 10.2s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 171, Positive cache size: 168, Positive conditional cache size: 120, Positive unconditional cache size: 48, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 9.5s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 182, Positive conditional cache size: 130, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 16.5s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 188, Positive cache size: 185, Positive conditional cache size: 133, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 13.7s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 199, Positive conditional cache size: 143, Positive unconditional cache size: 56, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 15.6s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 205, Positive cache size: 202, Positive conditional cache size: 146, Positive unconditional cache size: 56, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 23.5s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 216, Positive conditional cache size: 156, Positive unconditional cache size: 60, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 33.1s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 222, Positive cache size: 219, Positive conditional cache size: 159, Positive unconditional cache size: 60, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 33.7s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 233, Positive conditional cache size: 169, Positive unconditional cache size: 64, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 30.6s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 239, Positive cache size: 236, Positive conditional cache size: 172, Positive unconditional cache size: 64, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 37.2s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 250, Positive conditional cache size: 182, Positive unconditional cache size: 68, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 41.1s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 256, Positive cache size: 253, Positive conditional cache size: 185, Positive unconditional cache size: 68, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 76.6s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 267, Positive conditional cache size: 195, Positive unconditional cache size: 72, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 67.7s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 273, Positive cache size: 270, Positive conditional cache size: 198, Positive unconditional cache size: 72, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 109.5s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 284, Positive conditional cache size: 208, Positive unconditional cache size: 76, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 65.9s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 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): 290, Positive cache size: 287, Positive conditional cache size: 211, Positive unconditional cache size: 76, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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: 169.2s, 55 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 301, Positive conditional cache size: 221, Positive unconditional cache size: 80, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 586 for 20534ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 586 for 20534ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 586 for 20534ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 260 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: 843.3s, OverallIterations: 43, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3459 IncrementalHoareTripleChecker+Invalid, 3540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 6 mSDtfsCounter, 3459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=20, InterpolantAutomatonStates: 160, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 3528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 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