/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:04:24,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:04:24,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:04:24,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:04:24,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:04:24,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:04:24,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:04:24,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:04:24,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:04:24,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:04:24,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:04:24,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:04:24,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:04:24,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:04:24,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:04:24,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:04:24,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:04:24,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:04:24,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:04:24,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:04:24,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:04:24,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:04:24,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:04:24,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:04:24,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:04:24,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:04:24,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:04:24,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:04:24,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:04:24,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:04:24,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:04:24,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:04:24,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:04:24,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:04:24,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:04:24,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:04:24,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:04:24,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:04:24,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:04:24,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:04:24,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:04:24,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 03:04:24,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:04:24,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:04:24,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:04:24,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:04:24,657 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:04:24,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:04:24,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:04:24,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:04:24,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:04:24,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:04:24,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:04:24,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:04:24,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:04:24,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:04:24,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:04:24,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:04:24,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:04:24,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:04:24,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:04:24,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:04:24,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:04:24,660 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:04:24,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:04:24,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:04:24,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:04:24,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:04:24,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:04:24,924 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:04:24,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-12-06 03:04:25,929 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:04:26,069 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:04:26,069 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-12-06 03:04:26,074 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcb2b72c/4b4561bb4af74b5583b5fe8d52e01ff4/FLAG682053e5f [2022-12-06 03:04:26,083 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcb2b72c/4b4561bb4af74b5583b5fe8d52e01ff4 [2022-12-06 03:04:26,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:04:26,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:04:26,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:04:26,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:04:26,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:04:26,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be32923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26, skipping insertion in model container [2022-12-06 03:04:26,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:04:26,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:04:26,259 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-12-06 03:04:26,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:04:26,286 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:04:26,320 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-12-06 03:04:26,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:04:26,334 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:04:26,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26 WrapperNode [2022-12-06 03:04:26,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:04:26,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:04:26,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:04:26,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:04:26,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,387 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2022-12-06 03:04:26,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:04:26,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:04:26,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:04:26,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:04:26,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,420 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:04:26,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:04:26,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:04:26,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:04:26,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (1/1) ... [2022-12-06 03:04:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:04:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:04:26,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:04:26,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:04:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:04:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:04:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:04:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 03:04:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:04:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:04:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:04:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:04:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:04:26,580 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:04:26,647 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:04:26,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:04:26,903 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:04:26,910 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:04:26,910 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 03:04:26,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:04:26 BoogieIcfgContainer [2022-12-06 03:04:26,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:04:26,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:04:26,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:04:26,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:04:26,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:04:26" (1/3) ... [2022-12-06 03:04:26,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:04:26, skipping insertion in model container [2022-12-06 03:04:26,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:04:26" (2/3) ... [2022-12-06 03:04:26,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:04:26, skipping insertion in model container [2022-12-06 03:04:26,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:04:26" (3/3) ... [2022-12-06 03:04:26,927 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-12-06 03:04:26,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:04:26,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:04:26,940 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:04:27,009 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 03:04:27,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 172 transitions, 368 flow [2022-12-06 03:04:27,115 INFO L130 PetriNetUnfolder]: 15/169 cut-off events. [2022-12-06 03:04:27,116 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:04:27,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 15/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 03:04:27,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 172 transitions, 368 flow [2022-12-06 03:04:27,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 159 transitions, 336 flow [2022-12-06 03:04:27,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:27,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 159 transitions, 336 flow [2022-12-06 03:04:27,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 159 transitions, 336 flow [2022-12-06 03:04:27,205 INFO L130 PetriNetUnfolder]: 15/159 cut-off events. [2022-12-06 03:04:27,205 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:04:27,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 15/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 198 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 03:04:27,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 159 transitions, 336 flow [2022-12-06 03:04:27,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 3534 [2022-12-06 03:04:31,765 INFO L203 LiptonReduction]: Total number of compositions: 131 [2022-12-06 03:04:31,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:04:31,780 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;@2356b799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:04:31,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 03:04:31,784 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 03:04:31,784 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:04:31,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:31,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:31,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash 514205932, now seen corresponding path program 1 times [2022-12-06 03:04:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:31,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776104205] [2022-12-06 03:04:31,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:31,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:32,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776104205] [2022-12-06 03:04:32,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776104205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:32,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:32,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:04:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469090078] [2022-12-06 03:04:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:32,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:04:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:04:32,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:04:32,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 03:04:32,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:32,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:32,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 03:04:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:32,265 INFO L130 PetriNetUnfolder]: 562/733 cut-off events. [2022-12-06 03:04:32,265 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 03:04:32,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 733 events. 562/733 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2287 event pairs, 245 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1283. Up to 728 conditions per place. [2022-12-06 03:04:32,271 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 03:04:32,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 130 flow [2022-12-06 03:04:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:04:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:04:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 03:04:32,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-06 03:04:32,281 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-12-06 03:04:32,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:32,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 29 transitions, 130 flow [2022-12-06 03:04:32,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 130 flow [2022-12-06 03:04:32,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 03:04:33,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:04:33,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1073 [2022-12-06 03:04:33,356 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 126 flow [2022-12-06 03:04:33,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:33,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:33,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:33,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:04:33,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash 226024399, now seen corresponding path program 1 times [2022-12-06 03:04:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:33,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082867023] [2022-12-06 03:04:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:33,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082867023] [2022-12-06 03:04:33,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082867023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:33,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:33,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:04:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964981821] [2022-12-06 03:04:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:33,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:04:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:04:33,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:04:33,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:04:33,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:33,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:33,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:04:33,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:33,720 INFO L130 PetriNetUnfolder]: 772/1043 cut-off events. [2022-12-06 03:04:33,720 INFO L131 PetriNetUnfolder]: For 148/158 co-relation queries the response was YES. [2022-12-06 03:04:33,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3152 conditions, 1043 events. 772/1043 cut-off events. For 148/158 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3858 event pairs, 154 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 2608. Up to 1040 conditions per place. [2022-12-06 03:04:33,727 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2022-12-06 03:04:33,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 299 flow [2022-12-06 03:04:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:04:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:04:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 03:04:33,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-06 03:04:33,730 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-06 03:04:33,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:33,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 46 transitions, 299 flow [2022-12-06 03:04:33,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 46 transitions, 299 flow [2022-12-06 03:04:33,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 03:04:33,736 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:33,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:04:33,737 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 46 transitions, 299 flow [2022-12-06 03:04:33,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:33,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:33,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:33,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:04:33,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -869635647, now seen corresponding path program 1 times [2022-12-06 03:04:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:33,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469025872] [2022-12-06 03:04:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:33,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469025872] [2022-12-06 03:04:33,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469025872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:33,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:33,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:04:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776136970] [2022-12-06 03:04:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:04:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:04:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:04:33,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 03:04:33,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 46 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:33,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:33,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 03:04:33,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:34,242 INFO L130 PetriNetUnfolder]: 1451/1989 cut-off events. [2022-12-06 03:04:34,242 INFO L131 PetriNetUnfolder]: For 419/439 co-relation queries the response was YES. [2022-12-06 03:04:34,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 1989 events. 1451/1989 cut-off events. For 419/439 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8574 event pairs, 202 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 3472. Up to 1982 conditions per place. [2022-12-06 03:04:34,254 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 99 selfloop transitions, 4 changer transitions 6/111 dead transitions. [2022-12-06 03:04:34,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 111 transitions, 950 flow [2022-12-06 03:04:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:04:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:04:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 03:04:34,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-06 03:04:34,257 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-06 03:04:34,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:34,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 111 transitions, 950 flow [2022-12-06 03:04:34,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 111 transitions, 950 flow [2022-12-06 03:04:34,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 03:04:36,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:04:36,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2639 [2022-12-06 03:04:36,896 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 110 transitions, 942 flow [2022-12-06 03:04:36,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:36,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:36,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:36,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:04:36,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash -658284734, now seen corresponding path program 1 times [2022-12-06 03:04:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:36,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517808733] [2022-12-06 03:04:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:04:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:36,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517808733] [2022-12-06 03:04:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517808733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:36,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:36,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:04:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029707395] [2022-12-06 03:04:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:36,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:04:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:36,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:04:36,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:04:36,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:04:36,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 110 transitions, 942 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:36,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:36,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:04:36,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:37,186 INFO L130 PetriNetUnfolder]: 1557/2147 cut-off events. [2022-12-06 03:04:37,186 INFO L131 PetriNetUnfolder]: For 1540/1590 co-relation queries the response was YES. [2022-12-06 03:04:37,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10400 conditions, 2147 events. 1557/2147 cut-off events. For 1540/1590 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9384 event pairs, 165 based on Foata normal form. 8/1479 useless extension candidates. Maximal degree in co-relation 5519. Up to 2059 conditions per place. [2022-12-06 03:04:37,201 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 114 selfloop transitions, 5 changer transitions 5/127 dead transitions. [2022-12-06 03:04:37,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 127 transitions, 1320 flow [2022-12-06 03:04:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:04:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:04:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 03:04:37,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 03:04:37,204 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 03:04:37,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:37,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 127 transitions, 1320 flow [2022-12-06 03:04:37,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 127 transitions, 1320 flow [2022-12-06 03:04:37,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 03:04:37,215 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:37,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 03:04:37,221 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 127 transitions, 1320 flow [2022-12-06 03:04:37,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:37,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:37,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:37,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:04:37,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1075452979, now seen corresponding path program 1 times [2022-12-06 03:04:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78090914] [2022-12-06 03:04:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:37,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:37,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78090914] [2022-12-06 03:04:37,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78090914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:37,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:37,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:04:37,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597289066] [2022-12-06 03:04:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:37,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:04:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:37,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:04:37,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:04:37,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:37,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 127 transitions, 1320 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:37,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:37,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:37,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:37,512 INFO L130 PetriNetUnfolder]: 1223/1776 cut-off events. [2022-12-06 03:04:37,512 INFO L131 PetriNetUnfolder]: For 2464/2464 co-relation queries the response was YES. [2022-12-06 03:04:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9807 conditions, 1776 events. 1223/1776 cut-off events. For 2464/2464 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7208 event pairs, 179 based on Foata normal form. 0/1382 useless extension candidates. Maximal degree in co-relation 6168. Up to 1582 conditions per place. [2022-12-06 03:04:37,524 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 130 selfloop transitions, 2 changer transitions 17/151 dead transitions. [2022-12-06 03:04:37,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 151 transitions, 1864 flow [2022-12-06 03:04:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:04:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:04:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 03:04:37,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-06 03:04:37,526 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-12-06 03:04:37,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:37,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 151 transitions, 1864 flow [2022-12-06 03:04:37,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 151 transitions, 1864 flow [2022-12-06 03:04:37,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 03:04:37,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:37,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 03:04:37,561 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 151 transitions, 1864 flow [2022-12-06 03:04:37,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:37,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:37,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:37,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:04:37,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:37,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 305258680, now seen corresponding path program 1 times [2022-12-06 03:04:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:37,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819708744] [2022-12-06 03:04:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:37,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819708744] [2022-12-06 03:04:37,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819708744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:37,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:37,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:04:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518095406] [2022-12-06 03:04:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:37,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:04:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:04:37,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:04:37,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:04:37,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 151 transitions, 1864 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:37,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:37,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:04:37,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:37,791 INFO L130 PetriNetUnfolder]: 966/1387 cut-off events. [2022-12-06 03:04:37,791 INFO L131 PetriNetUnfolder]: For 3143/3250 co-relation queries the response was YES. [2022-12-06 03:04:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8935 conditions, 1387 events. 966/1387 cut-off events. For 3143/3250 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5467 event pairs, 117 based on Foata normal form. 12/1085 useless extension candidates. Maximal degree in co-relation 7087. Up to 1240 conditions per place. [2022-12-06 03:04:37,800 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 60 selfloop transitions, 0 changer transitions 51/113 dead transitions. [2022-12-06 03:04:37,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 113 transitions, 1603 flow [2022-12-06 03:04:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:04:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:04:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 03:04:37,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:04:37,802 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-12-06 03:04:37,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:37,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 113 transitions, 1603 flow [2022-12-06 03:04:37,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 113 transitions, 1603 flow [2022-12-06 03:04:37,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 03:04:37,810 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:37,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 03:04:37,811 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 113 transitions, 1603 flow [2022-12-06 03:04:37,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:37,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:37,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 03:04:37,811 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:37,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 698450438, now seen corresponding path program 1 times [2022-12-06 03:04:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332485369] [2022-12-06 03:04:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:04:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332485369] [2022-12-06 03:04:37,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332485369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:37,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:37,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:04:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857924389] [2022-12-06 03:04:37,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:37,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:04:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:04:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:04:37,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:37,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 113 transitions, 1603 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:37,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:37,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:37,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:38,179 INFO L130 PetriNetUnfolder]: 1384/1956 cut-off events. [2022-12-06 03:04:38,179 INFO L131 PetriNetUnfolder]: For 4283/4356 co-relation queries the response was YES. [2022-12-06 03:04:38,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14664 conditions, 1956 events. 1384/1956 cut-off events. For 4283/4356 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7677 event pairs, 124 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 12462. Up to 1798 conditions per place. [2022-12-06 03:04:38,193 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 133 selfloop transitions, 16 changer transitions 51/201 dead transitions. [2022-12-06 03:04:38,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 201 transitions, 3257 flow [2022-12-06 03:04:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:04:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:04:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 03:04:38,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2022-12-06 03:04:38,195 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-06 03:04:38,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:38,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 201 transitions, 3257 flow [2022-12-06 03:04:38,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 201 transitions, 3257 flow [2022-12-06 03:04:38,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 03:04:38,207 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:38,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:04:38,208 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 201 transitions, 3257 flow [2022-12-06 03:04:38,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:38,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:38,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:38,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 03:04:38,209 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2078267520, now seen corresponding path program 2 times [2022-12-06 03:04:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:38,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010820670] [2022-12-06 03:04:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010820670] [2022-12-06 03:04:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010820670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:04:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272832824] [2022-12-06 03:04:38,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:04:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:04:38,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:04:38,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:04:38,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:04:38,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:04:38,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:04:38,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:04:38,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:04:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:38,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:04:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:38,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272832824] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 03:04:38,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 03:04:38,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2022-12-06 03:04:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129901536] [2022-12-06 03:04:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:38,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:04:38,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:38,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:04:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 03:04:38,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:38,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 201 transitions, 3257 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:38,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:38,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:38,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:38,942 INFO L130 PetriNetUnfolder]: 1860/2606 cut-off events. [2022-12-06 03:04:38,943 INFO L131 PetriNetUnfolder]: For 5240/5316 co-relation queries the response was YES. [2022-12-06 03:04:38,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22285 conditions, 2606 events. 1860/2606 cut-off events. For 5240/5316 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10456 event pairs, 94 based on Foata normal form. 0/1848 useless extension candidates. Maximal degree in co-relation 19610. Up to 2423 conditions per place. [2022-12-06 03:04:38,956 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 312 selfloop transitions, 73 changer transitions 51/437 dead transitions. [2022-12-06 03:04:38,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 437 transitions, 7940 flow [2022-12-06 03:04:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:04:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:04:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2022-12-06 03:04:38,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2022-12-06 03:04:38,958 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2022-12-06 03:04:38,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:38,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 437 transitions, 7940 flow [2022-12-06 03:04:38,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 437 transitions, 7940 flow [2022-12-06 03:04:38,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:04:38,973 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:38,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 03:04:38,973 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 437 transitions, 7940 flow [2022-12-06 03:04:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:38,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:38,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:38,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 03:04:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:04:39,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 112292712, now seen corresponding path program 3 times [2022-12-06 03:04:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249595073] [2022-12-06 03:04:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:04:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249595073] [2022-12-06 03:04:39,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249595073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:39,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:39,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:04:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533683038] [2022-12-06 03:04:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:39,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:04:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:39,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:04:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:04:39,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:39,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 437 transitions, 7940 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:39,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:39,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:39,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:39,772 INFO L130 PetriNetUnfolder]: 2090/2925 cut-off events. [2022-12-06 03:04:39,772 INFO L131 PetriNetUnfolder]: For 6720/6824 co-relation queries the response was YES. [2022-12-06 03:04:39,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27955 conditions, 2925 events. 2090/2925 cut-off events. For 6720/6824 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12065 event pairs, 92 based on Foata normal form. 0/2069 useless extension candidates. Maximal degree in co-relation 24814. Up to 2734 conditions per place. [2022-12-06 03:04:39,790 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 444 selfloop transitions, 48 changer transitions 51/544 dead transitions. [2022-12-06 03:04:39,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 544 transitions, 10977 flow [2022-12-06 03:04:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:04:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:04:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-06 03:04:39,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2022-12-06 03:04:39,792 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2022-12-06 03:04:39,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:39,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 544 transitions, 10977 flow [2022-12-06 03:04:39,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 544 transitions, 10977 flow [2022-12-06 03:04:39,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:04:39,810 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:39,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 03:04:39,811 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 544 transitions, 10977 flow [2022-12-06 03:04:39,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:39,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:39,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 03:04:39,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 394077132, now seen corresponding path program 4 times [2022-12-06 03:04:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:39,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203937851] [2022-12-06 03:04:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:04:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:39,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203937851] [2022-12-06 03:04:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203937851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:39,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:39,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:04:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953699935] [2022-12-06 03:04:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:39,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:04:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:04:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:04:39,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:39,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 544 transitions, 10977 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:39,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:39,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:39,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:40,413 INFO L130 PetriNetUnfolder]: 2144/2989 cut-off events. [2022-12-06 03:04:40,414 INFO L131 PetriNetUnfolder]: For 6646/6750 co-relation queries the response was YES. [2022-12-06 03:04:40,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31476 conditions, 2989 events. 2144/2989 cut-off events. For 6646/6750 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12234 event pairs, 94 based on Foata normal form. 0/2125 useless extension candidates. Maximal degree in co-relation 28060. Up to 2796 conditions per place. [2022-12-06 03:04:40,432 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 437 selfloop transitions, 65 changer transitions 51/554 dead transitions. [2022-12-06 03:04:40,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 554 transitions, 12278 flow [2022-12-06 03:04:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:04:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:04:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-06 03:04:40,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2022-12-06 03:04:40,433 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-12-06 03:04:40,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:40,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 554 transitions, 12278 flow [2022-12-06 03:04:40,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 554 transitions, 12278 flow [2022-12-06 03:04:40,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:04:40,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:40,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 03:04:40,454 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 554 transitions, 12278 flow [2022-12-06 03:04:40,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:40,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:40,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:40,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 03:04:40,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash -816750046, now seen corresponding path program 5 times [2022-12-06 03:04:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207671451] [2022-12-06 03:04:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:04:40,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:40,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207671451] [2022-12-06 03:04:40,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207671451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:40,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:40,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:04:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851803041] [2022-12-06 03:04:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:40,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:04:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:04:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:04:40,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:40,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 554 transitions, 12278 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:40,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:40,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:40,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:40,985 INFO L130 PetriNetUnfolder]: 2151/2995 cut-off events. [2022-12-06 03:04:40,985 INFO L131 PetriNetUnfolder]: For 8980/9120 co-relation queries the response was YES. [2022-12-06 03:04:40,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34474 conditions, 2995 events. 2151/2995 cut-off events. For 8980/9120 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12338 event pairs, 100 based on Foata normal form. 4/2137 useless extension candidates. Maximal degree in co-relation 30765. Up to 2808 conditions per place. [2022-12-06 03:04:41,005 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 449 selfloop transitions, 50 changer transitions 51/551 dead transitions. [2022-12-06 03:04:41,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 551 transitions, 13310 flow [2022-12-06 03:04:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:04:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:04:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 03:04:41,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-12-06 03:04:41,007 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2022-12-06 03:04:41,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:41,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 551 transitions, 13310 flow [2022-12-06 03:04:41,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 551 transitions, 13310 flow [2022-12-06 03:04:41,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:04:41,029 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:41,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 03:04:41,029 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 551 transitions, 13310 flow [2022-12-06 03:04:41,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:41,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:41,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:41,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 03:04:41,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash -534965626, now seen corresponding path program 6 times [2022-12-06 03:04:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:41,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536657827] [2022-12-06 03:04:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:04:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:41,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536657827] [2022-12-06 03:04:41,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536657827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:41,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:41,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:04:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110276301] [2022-12-06 03:04:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:41,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:04:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:04:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:04:41,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:04:41,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 551 transitions, 13310 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:41,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:41,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:04:41,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:41,749 INFO L130 PetriNetUnfolder]: 2465/3409 cut-off events. [2022-12-06 03:04:41,749 INFO L131 PetriNetUnfolder]: For 14875/15019 co-relation queries the response was YES. [2022-12-06 03:04:41,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42620 conditions, 3409 events. 2465/3409 cut-off events. For 14875/15019 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14186 event pairs, 104 based on Foata normal form. 4/2407 useless extension candidates. Maximal degree in co-relation 38562. Up to 3202 conditions per place. [2022-12-06 03:04:41,806 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 484 selfloop transitions, 56 changer transitions 51/592 dead transitions. [2022-12-06 03:04:41,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 592 transitions, 15480 flow [2022-12-06 03:04:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:04:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:04:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 03:04:41,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2022-12-06 03:04:41,808 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 48 predicate places. [2022-12-06 03:04:41,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:41,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 592 transitions, 15480 flow [2022-12-06 03:04:41,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 592 transitions, 15480 flow [2022-12-06 03:04:41,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:04:41,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:41,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 03:04:41,837 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 592 transitions, 15480 flow [2022-12-06 03:04:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:41,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:41,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:41,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 03:04:41,838 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1100646296, now seen corresponding path program 1 times [2022-12-06 03:04:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:41,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785138468] [2022-12-06 03:04:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:41,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785138468] [2022-12-06 03:04:41,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785138468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:41,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:41,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:04:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464703816] [2022-12-06 03:04:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:41,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:04:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:04:41,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:04:41,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:04:41,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 592 transitions, 15480 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:41,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:41,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:04:41,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:42,366 INFO L130 PetriNetUnfolder]: 2411/3354 cut-off events. [2022-12-06 03:04:42,367 INFO L131 PetriNetUnfolder]: For 21080/21268 co-relation queries the response was YES. [2022-12-06 03:04:42,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44982 conditions, 3354 events. 2411/3354 cut-off events. For 21080/21268 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14077 event pairs, 100 based on Foata normal form. 8/2422 useless extension candidates. Maximal degree in co-relation 40607. Up to 3153 conditions per place. [2022-12-06 03:04:42,393 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 548 selfloop transitions, 32 changer transitions 51/640 dead transitions. [2022-12-06 03:04:42,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 640 transitions, 17988 flow [2022-12-06 03:04:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:04:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:04:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 03:04:42,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-06 03:04:42,395 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2022-12-06 03:04:42,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:42,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 640 transitions, 17988 flow [2022-12-06 03:04:42,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 640 transitions, 17988 flow [2022-12-06 03:04:42,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:04:42,425 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:42,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 03:04:42,426 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 640 transitions, 17988 flow [2022-12-06 03:04:42,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:42,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:42,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:42,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 03:04:42,426 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:42,427 INFO L85 PathProgramCache]: Analyzing trace with hash 558212554, now seen corresponding path program 1 times [2022-12-06 03:04:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:42,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840361885] [2022-12-06 03:04:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840361885] [2022-12-06 03:04:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840361885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:04:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601229962] [2022-12-06 03:04:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:43,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:04:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:04:43,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:04:43,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:04:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:44,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 03:04:44,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:04:44,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:04:44,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 03:04:44,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:04:44,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 03:04:44,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:04:44,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-12-06 03:04:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:44,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:04:47,386 INFO L321 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2022-12-06 03:04:47,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-12-06 03:04:47,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:04:47,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 209 [2022-12-06 03:04:49,675 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 03:04:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:52,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601229962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:04:52,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:04:52,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-12-06 03:04:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908210425] [2022-12-06 03:04:52,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:04:52,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:04:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:04:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=548, Unknown=1, NotChecked=0, Total=650 [2022-12-06 03:04:52,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 03:04:52,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 640 transitions, 17988 flow. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:52,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:52,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 03:04:52,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:05:05,839 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 90 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:05:10,973 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 77 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:05:26,282 WARN L233 SmtUtils]: Spent 15.08s on a formula simplification. DAG size of input: 86 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:05:37,174 WARN L233 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 73 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:05:39,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:06:47,613 WARN L233 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 66 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:06:52,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:07:27,274 WARN L233 SmtUtils]: Spent 34.76s on a formula simplification. DAG size of input: 62 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:07:32,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:07:34,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:07:36,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:07:51,302 WARN L233 SmtUtils]: Spent 14.86s on a formula simplification. DAG size of input: 99 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:07:58,257 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 95 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:08:05,953 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 96 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:08:18,860 WARN L233 SmtUtils]: Spent 8.86s on a formula simplification. DAG size of input: 139 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:08:20,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:08:32,899 WARN L233 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 135 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:08:49,138 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 111 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:08:51,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:09:00,832 WARN L233 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 92 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:09:17,984 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 93 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:09:21,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:09:29,917 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:09:39,173 WARN L233 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 110 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:09:45,880 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 123 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:10:01,534 WARN L233 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 112 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:10:08,915 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 89 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:10:24,696 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 78 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:10:36,160 WARN L233 SmtUtils]: Spent 11.40s on a formula simplification. DAG size of input: 106 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:10:45,280 WARN L233 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 119 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:11:05,076 WARN L233 SmtUtils]: Spent 13.25s on a formula simplification. DAG size of input: 174 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:11:07,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:13,769 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 95 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:11:23,877 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 124 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:11:47,293 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 94 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:03,748 WARN L233 SmtUtils]: Spent 14.57s on a formula simplification. DAG size of input: 170 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:10,098 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 91 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:18,408 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 108 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:30,583 WARN L233 SmtUtils]: Spent 11.42s on a formula simplification. DAG size of input: 115 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:12:56,166 WARN L233 SmtUtils]: Spent 10.67s on a formula simplification. DAG size of input: 146 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:08,739 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 136 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:25,767 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 111 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:49,091 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 120 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:59,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:14:24,908 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 137 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:14:56,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:01,886 INFO L130 PetriNetUnfolder]: 58000/81047 cut-off events. [2022-12-06 03:15:01,887 INFO L131 PetriNetUnfolder]: For 107401/107401 co-relation queries the response was YES. [2022-12-06 03:15:02,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198535 conditions, 81047 events. 58000/81047 cut-off events. For 107401/107401 co-relation queries the response was YES. Maximal size of possible extension queue 3037. Compared 534609 event pairs, 108 based on Foata normal form. 48/53302 useless extension candidates. Maximal degree in co-relation 556664. Up to 80404 conditions per place. [2022-12-06 03:15:02,822 INFO L137 encePairwiseOnDemand]: 7/29 looper letters, 11924 selfloop transitions, 7051 changer transitions 259/19234 dead transitions. [2022-12-06 03:15:02,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 19234 transitions, 579390 flow [2022-12-06 03:15:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 325 states. [2022-12-06 03:15:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2022-12-06 03:15:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 4236 transitions. [2022-12-06 03:15:02,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4494429708222812 [2022-12-06 03:15:02,834 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 374 predicate places. [2022-12-06 03:15:02,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:15:02,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 19234 transitions, 579390 flow [2022-12-06 03:15:04,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 19234 transitions, 579390 flow [2022-12-06 03:15:04,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:15:04,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L47-5: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0] and [519] L84-3-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_25|) (= (store |v_#memory_int_55| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_55| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_21|)) |v_#memory_int_54|) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_55|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 03:15:04,402 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:15:04,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1569 [2022-12-06 03:15:04,403 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 19233 transitions, 579384 flow [2022-12-06 03:15:04,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:15:04,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:15:04,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:15:04,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:15:04,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 03:15:04,607 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:15:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:15:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash -917297608, now seen corresponding path program 2 times [2022-12-06 03:15:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:15:04,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385740093] [2022-12-06 03:15:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:15:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:15:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:15:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:15:05,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:15:05,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385740093] [2022-12-06 03:15:05,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385740093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:15:05,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011539568] [2022-12-06 03:15:05,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:15:05,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:15:05,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:15:05,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:15:05,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:15:06,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:15:06,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:15:06,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 03:15:06,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:15:06,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:15:06,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:06,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 60 [2022-12-06 03:15:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:15:06,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:15:07,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:07,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 85 [2022-12-06 03:15:07,555 INFO L321 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-12-06 03:15:07,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-06 03:15:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:15:07,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011539568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:15:07,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:15:07,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-12-06 03:15:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519823858] [2022-12-06 03:15:07,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:15:07,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:15:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:15:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:15:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:15:07,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:15:07,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 19233 transitions, 579384 flow. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:15:07,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:15:07,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:15:07,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 03:18:43,333 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:18:43,334 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:18:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-12-06 03:18:43,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 03:18:43,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 03:18:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:18:43,575 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 676802 conditions, 43238 events (31719/43237 cut-off events. For 80188/80188 co-relation queries the response was YES. Maximal size of possible extension queue 5103. Compared 285475 event pairs, 61 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 340398. Up to 42595 conditions per place.). [2022-12-06 03:18:43,577 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 03:18:43,579 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 03:18:43,579 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 03:18:43,579 INFO L458 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:18:43,582 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:18:43,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:18:43,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:18:43 BasicIcfg [2022-12-06 03:18:43,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:18:43,584 INFO L158 Benchmark]: Toolchain (without parser) took 857497.61ms. Allocated memory was 179.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 143.5MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 03:18:43,584 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:18:43,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.17ms. Allocated memory is still 179.3MB. Free memory was 143.5MB in the beginning and 131.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 03:18:43,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.82ms. Allocated memory is still 179.3MB. Free memory was 131.9MB in the beginning and 129.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:18:43,584 INFO L158 Benchmark]: Boogie Preprocessor took 34.06ms. Allocated memory is still 179.3MB. Free memory was 129.9MB in the beginning and 128.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:18:43,584 INFO L158 Benchmark]: RCFGBuilder took 489.61ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 111.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 03:18:43,584 INFO L158 Benchmark]: TraceAbstraction took 856669.44ms. Allocated memory was 179.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 110.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 03:18:43,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.17ms. Allocated memory is still 179.3MB. Free memory was 143.5MB in the beginning and 131.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.82ms. Allocated memory is still 179.3MB. Free memory was 131.9MB in the beginning and 129.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.06ms. Allocated memory is still 179.3MB. Free memory was 129.9MB in the beginning and 128.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 489.61ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 111.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 856669.44ms. Allocated memory was 179.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 110.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 154 PlacesBefore, 32 PlacesAfterwards, 159 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 52 ConcurrentYvCompositions, 9 ChoiceCompositions, 131 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 2142, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2001, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2001, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2160, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2001, unknown conditional: 0, unknown unconditional: 2001] , Statistics on independence cache: Total cache size (in pairs): 3540, Positive cache size: 3528, Positive conditional cache size: 0, Positive unconditional cache size: 3528, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 34 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 39 PlacesBefore, 38 PlacesAfterwards, 111 TransitionsBefore, 110 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 201 TransitionsBefore, 201 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 437 TransitionsBefore, 437 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 544 TransitionsBefore, 544 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 554 TransitionsBefore, 554 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 551 TransitionsBefore, 551 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 592 TransitionsBefore, 592 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 640 TransitionsBefore, 640 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 406 PlacesBefore, 405 PlacesAfterwards, 19234 TransitionsBefore, 19233 TransitionsAfterwards, 0 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 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 676802 conditions, 43238 events (31719/43237 cut-off events. For 80188/80188 co-relation queries the response was YES. Maximal size of possible extension queue 5103. Compared 285475 event pairs, 61 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 340398. Up to 42595 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 676802 conditions, 43238 events (31719/43237 cut-off events. For 80188/80188 co-relation queries the response was YES. Maximal size of possible extension queue 5103. Compared 285475 event pairs, 61 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 340398. Up to 42595 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 676802 conditions, 43238 events (31719/43237 cut-off events. For 80188/80188 co-relation queries the response was YES. Maximal size of possible extension queue 5103. Compared 285475 event pairs, 61 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 340398. Up to 42595 conditions per place.). - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 676802 conditions, 43238 events (31719/43237 cut-off events. For 80188/80188 co-relation queries the response was YES. Maximal size of possible extension queue 5103. Compared 285475 event pairs, 61 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 340398. Up to 42595 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 212 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 856.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 830.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 3640 SdHoareTripleChecker+Valid, 35.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3640 mSDsluCounter, 585 SdHoareTripleChecker+Invalid, 33.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 506 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10345 IncrementalHoareTripleChecker+Invalid, 11036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 79 mSDtfsCounter, 10345 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66307 ImplicationChecksByTransitivity, 582.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579390occurred in iteration=14, InterpolantAutomatonStates: 390, 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.7s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 439 ConstructedInterpolants, 13 QuantifiedInterpolants, 7323 SizeOfPredicates, 38 NumberOfNonLiveVariables, 689 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 12/26 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