/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/chl-chromosome-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:50:24,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:50:24,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:50:24,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:50:24,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:50:24,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:50:24,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:50:24,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:50:24,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:50:24,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:50:24,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:50:24,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:50:24,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:50:24,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:50:24,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:50:24,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:50:24,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:50:24,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:50:24,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:50:24,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:50:24,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:50:24,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:50:24,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:50:24,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:50:24,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:50:24,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:50:24,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:50:24,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:50:24,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:50:24,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:50:24,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:50:24,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:50:24,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:50:24,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:50:24,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:50:24,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:50:24,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:50:24,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:50:24,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:50:24,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:50:24,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:50:24,957 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 01:50:24,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:50:24,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:50:24,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:50:24,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:50:24,999 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:50:25,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:50:25,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:50:25,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:50:25,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:50:25,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:50:25,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:50:25,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:50:25,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:50:25,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:50:25,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:50:25,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:50:25,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:50:25,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:50:25,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:50:25,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:50:25,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:50:25,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:50:25,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:50:25,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:50:25,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:50:25,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:50:25,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:50:25,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:50:25,004 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 01:50:25,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:50:25,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:50:25,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:50:25,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:50:25,340 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:50:25,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-06 01:50:26,519 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:50:26,710 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:50:26,711 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-06 01:50:26,719 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b51f07a/2ca44a82cfce4e4d802ab3c161ed2b9f/FLAGb3ba80b83 [2022-12-06 01:50:26,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b51f07a/2ca44a82cfce4e4d802ab3c161ed2b9f [2022-12-06 01:50:26,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:50:26,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:50:26,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:50:26,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:50:26,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:50:26,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:50:26" (1/1) ... [2022-12-06 01:50:26,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aef1544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:26, skipping insertion in model container [2022-12-06 01:50:26,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:50:26" (1/1) ... [2022-12-06 01:50:26,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:50:26,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:50:26,967 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/chl-chromosome-symm.wvr.c[2695,2708] [2022-12-06 01:50:26,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:50:26,992 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:50:27,024 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/chl-chromosome-symm.wvr.c[2695,2708] [2022-12-06 01:50:27,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:50:27,045 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:50:27,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27 WrapperNode [2022-12-06 01:50:27,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:50:27,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:50:27,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:50:27,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:50:27,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,110 INFO L138 Inliner]: procedures = 25, calls = 37, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 194 [2022-12-06 01:50:27,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:50:27,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:50:27,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:50:27,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:50:27,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:50:27,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:50:27,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:50:27,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:50:27,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (1/1) ... [2022-12-06 01:50:27,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:50:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:27,184 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 01:50:27,208 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 01:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 01:50:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 01:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 01:50:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 01:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 01:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:50:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:50:27,223 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 01:50:27,367 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:50:27,369 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:50:27,659 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:50:27,668 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:50:27,668 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 01:50:27,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:27 BoogieIcfgContainer [2022-12-06 01:50:27,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:50:27,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:50:27,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:50:27,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:50:27,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:50:26" (1/3) ... [2022-12-06 01:50:27,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432516a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:50:27, skipping insertion in model container [2022-12-06 01:50:27,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:27" (2/3) ... [2022-12-06 01:50:27,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432516a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:50:27, skipping insertion in model container [2022-12-06 01:50:27,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:27" (3/3) ... [2022-12-06 01:50:27,677 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2022-12-06 01:50:27,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:50:27,693 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:50:27,693 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:50:27,768 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 01:50:27,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 01:50:27,917 INFO L130 PetriNetUnfolder]: 21/225 cut-off events. [2022-12-06 01:50:27,917 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:50:27,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 225 events. 21/225 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 261 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-06 01:50:27,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 01:50:27,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 217 transitions, 446 flow [2022-12-06 01:50:27,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:27,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 01:50:27,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 217 transitions, 446 flow [2022-12-06 01:50:28,028 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-06 01:50:28,029 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:50:28,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 260 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-06 01:50:28,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 01:50:28,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 5400 [2022-12-06 01:50:34,273 INFO L203 LiptonReduction]: Total number of compositions: 197 [2022-12-06 01:50:34,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:50:34,291 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;@98444be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:50:34,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 01:50:34,296 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 01:50:34,296 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:50:34,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:34,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:34,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1077272917, now seen corresponding path program 1 times [2022-12-06 01:50:34,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:34,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910844581] [2022-12-06 01:50:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:34,641 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 01:50:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910844581] [2022-12-06 01:50:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910844581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:50:34,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:50:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100429606] [2022-12-06 01:50:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:50:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:34,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:50:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:50:34,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:34,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 01:50:34,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:34,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:34,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:34,730 INFO L130 PetriNetUnfolder]: 53/98 cut-off events. [2022-12-06 01:50:34,731 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 01:50:34,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 98 events. 53/98 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 33 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 160. Up to 97 conditions per place. [2022-12-06 01:50:34,737 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2022-12-06 01:50:34,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 100 flow [2022-12-06 01:50:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:50:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:50:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 01:50:34,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 01:50:34,752 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2022-12-06 01:50:34,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:34,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 22 transitions, 100 flow [2022-12-06 01:50:34,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 22 transitions, 100 flow [2022-12-06 01:50:34,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:34,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:34,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:50:34,761 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 100 flow [2022-12-06 01:50:34,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 01:50:34,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:34,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:34,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:50:34,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 639991075, now seen corresponding path program 1 times [2022-12-06 01:50:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:34,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040088876] [2022-12-06 01:50:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:50:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:34,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040088876] [2022-12-06 01:50:34,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040088876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102194348] [2022-12-06 01:50:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:34,956 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 01:50:35,007 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 01:50:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:35,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 01:50:35,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:50:35,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:50:35,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102194348] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:35,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:35,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 01:50:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27917348] [2022-12-06 01:50:35,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:35,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:50:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:35,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:50:35,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:50:35,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:35,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 100 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:35,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:35,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:35,245 INFO L130 PetriNetUnfolder]: 53/104 cut-off events. [2022-12-06 01:50:35,245 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 01:50:35,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 104 events. 53/104 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 191 event pairs, 33 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 236. Up to 103 conditions per place. [2022-12-06 01:50:35,246 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2022-12-06 01:50:35,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 180 flow [2022-12-06 01:50:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:50:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:50:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-06 01:50:35,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 01:50:35,248 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2022-12-06 01:50:35,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:35,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 180 flow [2022-12-06 01:50:35,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 180 flow [2022-12-06 01:50:35,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:35,251 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:35,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 01:50:35,252 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 180 flow [2022-12-06 01:50:35,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:35,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:35,252 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:35,271 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 01:50:35,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:35,453 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2058199873, now seen corresponding path program 2 times [2022-12-06 01:50:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:35,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190949676] [2022-12-06 01:50:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 01:50:35,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:35,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190949676] [2022-12-06 01:50:35,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190949676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:35,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927576951] [2022-12-06 01:50:35,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:50:35,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:35,692 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 01:50:35,695 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 01:50:35,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 01:50:35,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:50:35,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 01:50:35,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:50:35,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 01:50:35,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927576951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:35,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:50:35,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-06 01:50:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516013006] [2022-12-06 01:50:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:35,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:50:35,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:50:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:50:35,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:35,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:35,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:35,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:35,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:35,950 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-06 01:50:35,950 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 01:50:35,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 123 events. 64/123 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 306 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 372. Up to 122 conditions per place. [2022-12-06 01:50:35,951 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 01:50:35,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 346 flow [2022-12-06 01:50:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:50:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:50:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 01:50:35,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 01:50:35,955 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2022-12-06 01:50:35,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:35,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 346 flow [2022-12-06 01:50:35,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 346 flow [2022-12-06 01:50:35,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:35,959 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:35,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:50:35,960 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 346 flow [2022-12-06 01:50:35,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:35,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:35,961 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:35,967 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 01:50:36,167 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,SelfDestructingSolverStorable2 [2022-12-06 01:50:36,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 682966989, now seen corresponding path program 3 times [2022-12-06 01:50:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:36,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799627696] [2022-12-06 01:50:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:36,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 01:50:36,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799627696] [2022-12-06 01:50:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799627696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366762574] [2022-12-06 01:50:36,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:50:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:36,337 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 01:50:36,340 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 01:50:36,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 01:50:36,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:50:36,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 01:50:36,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:50:36,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 01:50:36,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366762574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:36,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:50:36,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-06 01:50:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454933285] [2022-12-06 01:50:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:36,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:50:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:50:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:50:36,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:36,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:36,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:36,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:36,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:36,548 INFO L130 PetriNetUnfolder]: 90/171 cut-off events. [2022-12-06 01:50:36,549 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 01:50:36,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 171 events. 90/171 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 471 event pairs, 2 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 691. Up to 170 conditions per place. [2022-12-06 01:50:36,550 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 54 selfloop transitions, 6 changer transitions 2/62 dead transitions. [2022-12-06 01:50:36,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 62 transitions, 647 flow [2022-12-06 01:50:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:50:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:50:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 01:50:36,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 01:50:36,553 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 13 predicate places. [2022-12-06 01:50:36,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:36,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 62 transitions, 647 flow [2022-12-06 01:50:36,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 62 transitions, 647 flow [2022-12-06 01:50:36,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:36,556 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:36,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 01:50:36,557 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 62 transitions, 647 flow [2022-12-06 01:50:36,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:36,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:36,557 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:36,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:36,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:36,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash -466567759, now seen corresponding path program 4 times [2022-12-06 01:50:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:36,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520700283] [2022-12-06 01:50:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 01:50:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:36,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520700283] [2022-12-06 01:50:36,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520700283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:36,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937185111] [2022-12-06 01:50:36,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:50:36,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:36,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:36,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:36,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 01:50:37,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:50:37,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:50:37,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 01:50:37,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 01:50:37,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 01:50:37,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937185111] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:37,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:37,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 01:50:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117940221] [2022-12-06 01:50:37,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:37,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 01:50:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:37,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 01:50:37,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 01:50:37,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:37,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 62 transitions, 647 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:50:37,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:37,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:37,275 INFO L130 PetriNetUnfolder]: 90/173 cut-off events. [2022-12-06 01:50:37,276 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 01:50:37,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 173 events. 90/173 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 484 event pairs, 2 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 828. Up to 172 conditions per place. [2022-12-06 01:50:37,277 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 50 selfloop transitions, 12 changer transitions 2/64 dead transitions. [2022-12-06 01:50:37,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 795 flow [2022-12-06 01:50:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:50:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:50:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-12-06 01:50:37,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-06 01:50:37,300 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2022-12-06 01:50:37,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:37,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 64 transitions, 795 flow [2022-12-06 01:50:37,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 64 transitions, 795 flow [2022-12-06 01:50:37,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:37,303 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:37,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:50:37,304 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 64 transitions, 795 flow [2022-12-06 01:50:37,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:50:37,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:37,304 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:37,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:37,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:37,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:37,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1802292253, now seen corresponding path program 5 times [2022-12-06 01:50:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:37,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635715199] [2022-12-06 01:50:37,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 01:50:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:37,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635715199] [2022-12-06 01:50:37,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635715199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:37,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:50:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:50:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752122305] [2022-12-06 01:50:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:37,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:50:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:50:37,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:50:37,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:37,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 64 transitions, 795 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:37,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:37,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:37,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:37,818 INFO L130 PetriNetUnfolder]: 114/213 cut-off events. [2022-12-06 01:50:37,819 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 01:50:37,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 213 events. 114/213 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 595 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1245. Up to 212 conditions per place. [2022-12-06 01:50:37,821 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 74 selfloop transitions, 9 changer transitions 2/85 dead transitions. [2022-12-06 01:50:37,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 1220 flow [2022-12-06 01:50:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:50:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:50:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 01:50:37,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-06 01:50:37,823 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 22 predicate places. [2022-12-06 01:50:37,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:37,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 85 transitions, 1220 flow [2022-12-06 01:50:37,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 85 transitions, 1220 flow [2022-12-06 01:50:37,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:37,827 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:37,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:50:37,827 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 85 transitions, 1220 flow [2022-12-06 01:50:37,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:37,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:37,828 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:37,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:50:37,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1574238918, now seen corresponding path program 1 times [2022-12-06 01:50:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:37,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484073567] [2022-12-06 01:50:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-06 01:50:38,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:38,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484073567] [2022-12-06 01:50:38,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484073567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:38,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:50:38,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:50:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934021981] [2022-12-06 01:50:38,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:38,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:50:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:38,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:50:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:50:38,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:38,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 85 transitions, 1220 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:38,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:38,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:38,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:38,156 INFO L130 PetriNetUnfolder]: 160/299 cut-off events. [2022-12-06 01:50:38,156 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 01:50:38,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 299 events. 160/299 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 976 event pairs, 0 based on Foata normal form. 4/241 useless extension candidates. Maximal degree in co-relation 2002. Up to 298 conditions per place. [2022-12-06 01:50:38,159 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 100 selfloop transitions, 11 changer transitions 8/119 dead transitions. [2022-12-06 01:50:38,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 119 transitions, 1952 flow [2022-12-06 01:50:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:50:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:50:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 01:50:38,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 01:50:38,161 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2022-12-06 01:50:38,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:38,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 119 transitions, 1952 flow [2022-12-06 01:50:38,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 119 transitions, 1952 flow [2022-12-06 01:50:38,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:38,166 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:38,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:50:38,166 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 119 transitions, 1952 flow [2022-12-06 01:50:38,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:38,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:38,167 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:38,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:50:38,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 535660666, now seen corresponding path program 2 times [2022-12-06 01:50:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606827532] [2022-12-06 01:50:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-06 01:50:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:38,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606827532] [2022-12-06 01:50:38,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606827532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:38,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:50:38,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:50:38,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640895654] [2022-12-06 01:50:38,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:38,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:50:38,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:38,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:50:38,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:50:38,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:38,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 119 transitions, 1952 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:38,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:38,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:38,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:38,529 INFO L130 PetriNetUnfolder]: 145/270 cut-off events. [2022-12-06 01:50:38,529 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 01:50:38,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 270 events. 145/270 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 843 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 2030. Up to 269 conditions per place. [2022-12-06 01:50:38,532 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 95 selfloop transitions, 14 changer transitions 8/117 dead transitions. [2022-12-06 01:50:38,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 117 transitions, 2148 flow [2022-12-06 01:50:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:50:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:50:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 01:50:38,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 01:50:38,534 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 28 predicate places. [2022-12-06 01:50:38,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:38,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 117 transitions, 2148 flow [2022-12-06 01:50:38,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 117 transitions, 2148 flow [2022-12-06 01:50:38,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:38,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:38,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:50:38,540 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 117 transitions, 2148 flow [2022-12-06 01:50:38,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:38,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:38,540 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:38,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:50:38,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1567610143, now seen corresponding path program 1 times [2022-12-06 01:50:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:38,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330631393] [2022-12-06 01:50:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-06 01:50:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:38,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330631393] [2022-12-06 01:50:38,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330631393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:38,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:50:38,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:50:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136161603] [2022-12-06 01:50:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:38,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:50:38,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:50:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:50:38,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:38,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 117 transitions, 2148 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:38,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:38,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:38,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:38,845 INFO L130 PetriNetUnfolder]: 128/239 cut-off events. [2022-12-06 01:50:38,845 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 01:50:38,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 239 events. 128/239 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 722 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 2004. Up to 238 conditions per place. [2022-12-06 01:50:38,849 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 83 selfloop transitions, 11 changer transitions 8/102 dead transitions. [2022-12-06 01:50:38,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 2076 flow [2022-12-06 01:50:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:50:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:50:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 01:50:38,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-06 01:50:38,853 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 31 predicate places. [2022-12-06 01:50:38,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:38,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 102 transitions, 2076 flow [2022-12-06 01:50:38,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 102 transitions, 2076 flow [2022-12-06 01:50:38,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:38,862 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:38,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 01:50:38,863 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 102 transitions, 2076 flow [2022-12-06 01:50:38,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:38,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:38,864 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:38,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:50:38,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2020566198, now seen corresponding path program 1 times [2022-12-06 01:50:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:38,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620103508] [2022-12-06 01:50:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 01:50:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620103508] [2022-12-06 01:50:40,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620103508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:40,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585701934] [2022-12-06 01:50:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:40,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:40,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:40,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 01:50:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:40,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:50:40,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:40,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:50:40,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:50:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 01:50:40,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:40,928 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:50:40,929 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 52 [2022-12-06 01:50:40,966 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:40,967 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 01:50:40,975 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:40,975 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 01:50:40,978 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:50:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 01:50:40,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585701934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:40,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:40,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-06 01:50:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739383203] [2022-12-06 01:50:40,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:40,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 01:50:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 01:50:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-12-06 01:50:41,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:41,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 102 transitions, 2076 flow. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:41,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:41,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:41,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:41,919 INFO L130 PetriNetUnfolder]: 235/428 cut-off events. [2022-12-06 01:50:41,920 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 01:50:41,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4762 conditions, 428 events. 235/428 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1589 event pairs, 0 based on Foata normal form. 1/355 useless extension candidates. Maximal degree in co-relation 3905. Up to 427 conditions per place. [2022-12-06 01:50:41,925 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 127 selfloop transitions, 42 changer transitions 10/179 dead transitions. [2022-12-06 01:50:41,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 179 transitions, 4007 flow [2022-12-06 01:50:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:50:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:50:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2022-12-06 01:50:41,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30714285714285716 [2022-12-06 01:50:41,928 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 44 predicate places. [2022-12-06 01:50:41,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:41,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 179 transitions, 4007 flow [2022-12-06 01:50:41,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 179 transitions, 4007 flow [2022-12-06 01:50:41,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:42,966 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:50:42,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1039 [2022-12-06 01:50:42,967 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 177 transitions, 3963 flow [2022-12-06 01:50:42,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:42,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:42,967 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:42,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 01:50:43,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash -194126927, now seen corresponding path program 1 times [2022-12-06 01:50:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:43,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672600082] [2022-12-06 01:50:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 01:50:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:44,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672600082] [2022-12-06 01:50:44,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672600082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:44,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828946786] [2022-12-06 01:50:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:44,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:44,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:44,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:44,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 01:50:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:44,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:50:44,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:44,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:50:44,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:50:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:50:44,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:45,674 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:50:45,675 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 52 [2022-12-06 01:50:45,708 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:45,709 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 01:50:45,715 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:45,716 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 01:50:45,718 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:50:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:50:45,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828946786] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:45,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:45,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 27 [2022-12-06 01:50:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281055359] [2022-12-06 01:50:45,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:45,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 01:50:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:45,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 01:50:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2022-12-06 01:50:45,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:45,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 177 transitions, 3963 flow. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 01:50:45,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:45,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:45,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:46,735 INFO L130 PetriNetUnfolder]: 271/489 cut-off events. [2022-12-06 01:50:46,736 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 01:50:46,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5927 conditions, 489 events. 271/489 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1894 event pairs, 0 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 4858. Up to 490 conditions per place. [2022-12-06 01:50:46,741 INFO L137 encePairwiseOnDemand]: 6/20 looper letters, 154 selfloop transitions, 39 changer transitions 15/208 dead transitions. [2022-12-06 01:50:46,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 208 transitions, 5073 flow [2022-12-06 01:50:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:50:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:50:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2022-12-06 01:50:46,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2642857142857143 [2022-12-06 01:50:46,743 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 53 predicate places. [2022-12-06 01:50:46,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:46,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 208 transitions, 5073 flow [2022-12-06 01:50:46,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 208 transitions, 5073 flow [2022-12-06 01:50:46,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:47,790 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:50:47,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1047 [2022-12-06 01:50:47,791 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 206 transitions, 5025 flow [2022-12-06 01:50:47,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 01:50:47,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:47,791 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:47,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:47,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:47,997 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1920198967, now seen corresponding path program 1 times [2022-12-06 01:50:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:47,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098432865] [2022-12-06 01:50:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098432865] [2022-12-06 01:50:48,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098432865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420316104] [2022-12-06 01:50:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:48,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:48,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:48,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 01:50:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:48,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:50:48,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:49,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:50:49,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:50:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:49,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:49,791 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:50:49,791 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 52 [2022-12-06 01:50:49,823 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:49,824 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 01:50:49,830 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:49,830 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 01:50:49,833 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:50:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:49,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420316104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:49,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:49,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-06 01:50:49,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070195893] [2022-12-06 01:50:49,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:49,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 01:50:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:49,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 01:50:49,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-12-06 01:50:49,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:49,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 206 transitions, 5025 flow. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 01:50:49,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:49,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:49,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:50,540 INFO L130 PetriNetUnfolder]: 299/536 cut-off events. [2022-12-06 01:50:50,540 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 01:50:50,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7031 conditions, 536 events. 299/536 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2168 event pairs, 0 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 5781. Up to 537 conditions per place. [2022-12-06 01:50:50,547 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 174 selfloop transitions, 32 changer transitions 16/222 dead transitions. [2022-12-06 01:50:50,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 222 transitions, 5859 flow [2022-12-06 01:50:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:50:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:50:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-12-06 01:50:50,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2863636363636364 [2022-12-06 01:50:50,549 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 59 predicate places. [2022-12-06 01:50:50,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:50,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 222 transitions, 5859 flow [2022-12-06 01:50:50,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 222 transitions, 5859 flow [2022-12-06 01:50:50,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:50,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:50,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 01:50:50,560 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 222 transitions, 5859 flow [2022-12-06 01:50:50,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 01:50:50,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:50,560 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:50,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:50,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:50,766 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 200071323, now seen corresponding path program 2 times [2022-12-06 01:50:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046622430] [2022-12-06 01:50:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:50:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046622430] [2022-12-06 01:50:51,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046622430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753207291] [2022-12-06 01:50:51,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:50:51,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:51,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:51,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:51,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 01:50:51,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:50:51,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:50:51,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:50:51,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:52,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:50:52,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:50:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:52,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:52,818 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:50:52,819 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 52 [2022-12-06 01:50:52,854 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:52,854 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 01:50:52,862 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:52,862 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 01:50:52,865 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:50:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:52,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753207291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:52,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:52,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 28 [2022-12-06 01:50:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349011114] [2022-12-06 01:50:52,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:52,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 01:50:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 01:50:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2022-12-06 01:50:52,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:52,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 222 transitions, 5859 flow. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 01:50:52,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:52,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:52,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:53,732 INFO L130 PetriNetUnfolder]: 302/548 cut-off events. [2022-12-06 01:50:53,732 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 01:50:53,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 548 events. 302/548 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2270 event pairs, 0 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 6350. Up to 549 conditions per place. [2022-12-06 01:50:53,739 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 174 selfloop transitions, 34 changer transitions 22/230 dead transitions. [2022-12-06 01:50:53,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 230 transitions, 6533 flow [2022-12-06 01:50:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:50:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:50:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-12-06 01:50:53,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 01:50:53,742 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 70 predicate places. [2022-12-06 01:50:53,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:53,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 230 transitions, 6533 flow [2022-12-06 01:50:53,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 230 transitions, 6533 flow [2022-12-06 01:50:53,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:53,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:53,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 01:50:53,755 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 230 transitions, 6533 flow [2022-12-06 01:50:53,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 01:50:53,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:53,755 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:53,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:53,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 01:50:53,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1910684631, now seen corresponding path program 3 times [2022-12-06 01:50:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990339478] [2022-12-06 01:50:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:54,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990339478] [2022-12-06 01:50:54,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990339478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:54,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899263432] [2022-12-06 01:50:54,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:50:54,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:54,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:54,772 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:54,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 01:50:54,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 01:50:54,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:50:54,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 01:50:54,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:55,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:50:55,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:50:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:55,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:55,648 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:50:55,648 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 50 treesize of output 52 [2022-12-06 01:50:55,676 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:50:55,676 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 50 treesize of output 1 [2022-12-06 01:50:55,679 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:50:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:55,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899263432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:55,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:55,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 21 [2022-12-06 01:50:55,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316175001] [2022-12-06 01:50:55,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:55,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:50:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:55,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:50:55,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:50:55,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:50:55,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 230 transitions, 6533 flow. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:55,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:55,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:50:55,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:56,962 INFO L130 PetriNetUnfolder]: 390/700 cut-off events. [2022-12-06 01:50:56,963 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-06 01:50:56,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10572 conditions, 700 events. 390/700 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3127 event pairs, 2 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 8949. Up to 701 conditions per place. [2022-12-06 01:50:56,972 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 189 selfloop transitions, 106 changer transitions 25/320 dead transitions. [2022-12-06 01:50:56,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 320 transitions, 9708 flow [2022-12-06 01:50:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 01:50:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 01:50:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-12-06 01:50:56,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2657894736842105 [2022-12-06 01:50:56,974 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 88 predicate places. [2022-12-06 01:50:56,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:56,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 320 transitions, 9708 flow [2022-12-06 01:50:56,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 320 transitions, 9708 flow [2022-12-06 01:50:56,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:56,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, 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_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 01:50:57,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:50:57,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 01:50:57,112 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 320 transitions, 9710 flow [2022-12-06 01:50:57,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:57,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:57,113 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:57,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 01:50:57,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 01:50:57,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:50:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash 321513675, now seen corresponding path program 4 times [2022-12-06 01:50:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:57,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818054518] [2022-12-06 01:50:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:50:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:58,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818054518] [2022-12-06 01:50:58,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818054518] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:50:58,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242473543] [2022-12-06 01:50:58,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:50:58,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:50:58,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:50:58,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:50:58,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 01:50:58,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:50:58,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:50:58,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:50:58,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:50:58,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:50:58,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:50:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:58,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:50:59,168 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:50:59,169 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 58 treesize of output 62 [2022-12-06 01:50:59,207 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:50:59,208 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 58 treesize of output 1 [2022-12-06 01:50:59,216 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:50:59,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:50:59,222 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:50:59,231 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:50:59,231 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 58 treesize of output 1 [2022-12-06 01:50:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 01:50:59,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242473543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:50:59,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:50:59,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 26 [2022-12-06 01:50:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564847073] [2022-12-06 01:50:59,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:50:59,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 01:50:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 01:50:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-12-06 01:50:59,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:50:59,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 320 transitions, 9710 flow. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:50:59,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:59,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:50:59,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:00,220 INFO L130 PetriNetUnfolder]: 418/749 cut-off events. [2022-12-06 01:51:00,220 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 01:51:00,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12061 conditions, 749 events. 418/749 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3429 event pairs, 4 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 10185. Up to 750 conditions per place. [2022-12-06 01:51:00,240 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 268 selfloop transitions, 51 changer transitions 30/349 dead transitions. [2022-12-06 01:51:00,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 349 transitions, 11287 flow [2022-12-06 01:51:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:51:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:51:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-06 01:51:00,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2564102564102564 [2022-12-06 01:51:00,242 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 100 predicate places. [2022-12-06 01:51:00,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:00,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 349 transitions, 11287 flow [2022-12-06 01:51:00,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 349 transitions, 11287 flow [2022-12-06 01:51:00,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:01,460 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:51:01,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1219 [2022-12-06 01:51:01,461 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 347 transitions, 11223 flow [2022-12-06 01:51:01,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:01,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:01,461 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:01,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:01,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 01:51:01,667 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1271513923, now seen corresponding path program 1 times [2022-12-06 01:51:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005457606] [2022-12-06 01:51:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:51:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005457606] [2022-12-06 01:51:02,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005457606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629854799] [2022-12-06 01:51:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:02,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:02,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:02,367 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:02,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 01:51:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:02,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 01:51:02,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:02,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:51:02,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 01:51:02,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:02,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:51:02,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:03,277 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (let ((.cse0 (select .cse4 ~o_2~0.base))) (let ((.cse3 (select .cse0 c_~o_2~0.offset)) (.cse2 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse0 .cse1)) (= .cse2 .cse3) (< .cse3 .cse2)))))) (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (let ((.cse5 (select .cse8 ~o_2~0.base))) (let ((.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset)) (.cse7 (select .cse5 c_~o_2~0.offset))) (or (< (select .cse5 .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse6 .cse7) (< .cse6 .cse7)))))) (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (let ((.cse11 (select .cse10 ~o_2~0.base))) (let ((.cse9 (select .cse11 .cse1))) (or (< .cse9 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse9 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< (select (select .cse10 c_~o_0~0.base) c_~o_0~0.offset) (select .cse11 c_~o_2~0.offset))))))) (or (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (= (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse12 ~o_2~0.base) c_~o_2~0.offset)))) (< |c_thread1Thread1of1ForFork0_~i~0#1| 4)) (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (let ((.cse13 (select .cse16 ~o_2~0.base))) (let ((.cse15 (select (select .cse16 c_~o_0~0.base) c_~o_0~0.offset)) (.cse14 (select .cse13 c_~o_2~0.offset))) (or (= (select .cse13 .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse14 .cse15) (< .cse15 .cse14)))))) (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (let ((.cse19 (select .cse18 ~o_2~0.base))) (let ((.cse17 (select .cse19 .cse1))) (or (< .cse17 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse17) (= (select (select .cse18 c_~o_0~0.base) c_~o_0~0.offset) (select .cse19 c_~o_2~0.offset))))))) (forall ((v_ArrVal_846 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_846))) (let ((.cse21 (select .cse22 ~o_2~0.base))) (let ((.cse20 (select .cse21 .cse1))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse20) (= .cse20 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< (select .cse21 c_~o_2~0.offset) (select (select .cse22 c_~o_0~0.base) c_~o_0~0.offset))))))))) is different from false [2022-12-06 01:51:03,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:03,329 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 176 treesize of output 192 [2022-12-06 01:51:03,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:03,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-06 01:51:04,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:04,211 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:51:04,212 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 120 treesize of output 1 [2022-12-06 01:51:04,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:04,220 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:51:04,220 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 120 treesize of output 1 [2022-12-06 01:51:04,223 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:51:04,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:04,232 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:51:04,232 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 104 treesize of output 1 [2022-12-06 01:51:04,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:04,241 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:51:04,242 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 120 treesize of output 1 [2022-12-06 01:51:04,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:04,251 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:51:04,251 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 104 treesize of output 1 [2022-12-06 01:51:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:51:04,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629854799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:04,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:04,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-12-06 01:51:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277616315] [2022-12-06 01:51:04,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:04,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 01:51:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 01:51:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=755, Unknown=1, NotChecked=56, Total=930 [2022-12-06 01:51:04,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:51:04,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 347 transitions, 11223 flow. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 01:51:04,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:04,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:51:04,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:09,109 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 01:51:10,449 INFO L130 PetriNetUnfolder]: 697/1275 cut-off events. [2022-12-06 01:51:10,449 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-06 01:51:10,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21798 conditions, 1275 events. 697/1275 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6975 event pairs, 4 based on Foata normal form. 1/1014 useless extension candidates. Maximal degree in co-relation 17643. Up to 1276 conditions per place. [2022-12-06 01:51:10,460 INFO L137 encePairwiseOnDemand]: 6/21 looper letters, 449 selfloop transitions, 121 changer transitions 51/621 dead transitions. [2022-12-06 01:51:10,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 621 transitions, 21338 flow [2022-12-06 01:51:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 01:51:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 01:51:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 134 transitions. [2022-12-06 01:51:10,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29004329004329005 [2022-12-06 01:51:10,462 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 115 predicate places. [2022-12-06 01:51:10,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:10,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 621 transitions, 21338 flow [2022-12-06 01:51:10,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 621 transitions, 21338 flow [2022-12-06 01:51:10,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:12,272 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:51:12,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1811 [2022-12-06 01:51:12,273 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 619 transitions, 21270 flow [2022-12-06 01:51:12,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 01:51:12,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:12,273 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 01:51:12,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:12,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 01:51:12,479 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -53311263, now seen corresponding path program 1 times [2022-12-06 01:51:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:12,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144653616] [2022-12-06 01:51:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:51:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:13,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144653616] [2022-12-06 01:51:13,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144653616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:13,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889920363] [2022-12-06 01:51:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:13,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:13,327 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:13,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 01:51:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:13,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:51:13,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:13,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:13,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 01:51:13,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:14,142 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-06 01:51:14,142 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 165 treesize of output 107 [2022-12-06 01:51:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 01:51:14,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889920363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:14,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:14,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 27 [2022-12-06 01:51:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639128467] [2022-12-06 01:51:14,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:14,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 01:51:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:14,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 01:51:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2022-12-06 01:51:14,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:51:14,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 619 transitions, 21270 flow. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:14,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:14,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:51:14,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:15,610 INFO L130 PetriNetUnfolder]: 759/1385 cut-off events. [2022-12-06 01:51:15,611 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-06 01:51:15,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25060 conditions, 1385 events. 759/1385 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7725 event pairs, 4 based on Foata normal form. 2/1096 useless extension candidates. Maximal degree in co-relation 20371. Up to 1386 conditions per place. [2022-12-06 01:51:15,625 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 545 selfloop transitions, 84 changer transitions 61/690 dead transitions. [2022-12-06 01:51:15,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 690 transitions, 25082 flow [2022-12-06 01:51:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:51:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:51:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 73 transitions. [2022-12-06 01:51:15,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23174603174603176 [2022-12-06 01:51:15,626 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 126 predicate places. [2022-12-06 01:51:15,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:15,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 690 transitions, 25082 flow [2022-12-06 01:51:15,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 690 transitions, 25082 flow [2022-12-06 01:51:15,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:17,559 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:51:17,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1934 [2022-12-06 01:51:17,560 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 688 transitions, 25010 flow [2022-12-06 01:51:17,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:17,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:17,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:17,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:17,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 01:51:17,767 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2003922211, now seen corresponding path program 1 times [2022-12-06 01:51:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:17,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726760219] [2022-12-06 01:51:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:18,524 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 01:51:18,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:18,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726760219] [2022-12-06 01:51:18,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726760219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:18,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457190035] [2022-12-06 01:51:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:18,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:18,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:18,526 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:18,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 01:51:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:18,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:51:18,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:18,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:18,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:18,801 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 01:51:18,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:19,357 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:51:19,357 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 58 treesize of output 62 [2022-12-06 01:51:19,397 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:19,398 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 58 treesize of output 1 [2022-12-06 01:51:19,407 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:51:19,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:51:19,411 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:51:19,418 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:19,419 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 58 treesize of output 1 [2022-12-06 01:51:19,462 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 01:51:19,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457190035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:19,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:19,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-06 01:51:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767795878] [2022-12-06 01:51:19,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:19,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 01:51:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 01:51:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-06 01:51:19,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:51:19,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 688 transitions, 25010 flow. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 01:51:19,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:19,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:51:19,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:20,526 INFO L130 PetriNetUnfolder]: 760/1401 cut-off events. [2022-12-06 01:51:20,526 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 01:51:20,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26756 conditions, 1401 events. 760/1401 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7957 event pairs, 4 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 21539. Up to 1402 conditions per place. [2022-12-06 01:51:20,539 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 538 selfloop transitions, 82 changer transitions 77/697 dead transitions. [2022-12-06 01:51:20,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 697 transitions, 26740 flow [2022-12-06 01:51:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:51:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:51:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-12-06 01:51:20,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28174603174603174 [2022-12-06 01:51:20,541 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 134 predicate places. [2022-12-06 01:51:20,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:20,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 697 transitions, 26740 flow [2022-12-06 01:51:20,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 697 transitions, 26740 flow [2022-12-06 01:51:20,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:23,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:51:23,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2827 [2022-12-06 01:51:23,368 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 696 transitions, 26702 flow [2022-12-06 01:51:23,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 01:51:23,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:23,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:23,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 01:51:23,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 01:51:23,574 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1616767758, now seen corresponding path program 1 times [2022-12-06 01:51:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:23,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156556210] [2022-12-06 01:51:23,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:24,143 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 01:51:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156556210] [2022-12-06 01:51:24,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156556210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:24,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685938250] [2022-12-06 01:51:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:24,145 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 01:51:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:24,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:24,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:24,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:24,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:24,391 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 01:51:24,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:24,927 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:51:24,928 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 58 treesize of output 62 [2022-12-06 01:51:24,970 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:24,970 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 58 treesize of output 1 [2022-12-06 01:51:24,980 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:51:24,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:51:24,986 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:51:24,995 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:24,996 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 58 treesize of output 1 [2022-12-06 01:51:25,036 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 01:51:25,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685938250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:25,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:25,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-06 01:51:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836469624] [2022-12-06 01:51:25,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:25,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:51:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:51:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:51:25,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:51:25,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 696 transitions, 26702 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:51:25,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:25,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:51:25,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:25,965 INFO L130 PetriNetUnfolder]: 783/1448 cut-off events. [2022-12-06 01:51:25,966 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 01:51:25,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29103 conditions, 1448 events. 783/1448 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8359 event pairs, 11 based on Foata normal form. 2/1149 useless extension candidates. Maximal degree in co-relation 23451. Up to 1449 conditions per place. [2022-12-06 01:51:25,979 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 573 selfloop transitions, 60 changer transitions 84/717 dead transitions. [2022-12-06 01:51:25,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 717 transitions, 28946 flow [2022-12-06 01:51:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:51:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:51:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-12-06 01:51:25,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26859504132231404 [2022-12-06 01:51:25,980 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 141 predicate places. [2022-12-06 01:51:25,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:25,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 717 transitions, 28946 flow [2022-12-06 01:51:26,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 717 transitions, 28946 flow [2022-12-06 01:51:26,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:26,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:26,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 01:51:26,008 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 717 transitions, 28946 flow [2022-12-06 01:51:26,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:51:26,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:26,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:26,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:26,216 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -122498518, now seen corresponding path program 2 times [2022-12-06 01:51:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:26,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476439520] [2022-12-06 01:51:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:26,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:26,892 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 01:51:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:26,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476439520] [2022-12-06 01:51:26,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476439520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:26,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494643619] [2022-12-06 01:51:26,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:51:26,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:26,894 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:26,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 01:51:27,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:51:27,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:27,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:27,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:27,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:27,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:27,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:27,260 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 01:51:27,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:27,622 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-06 01:51:27,623 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 165 treesize of output 107 [2022-12-06 01:51:27,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 01:51:27,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494643619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:27,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:27,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 25 [2022-12-06 01:51:27,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803113917] [2022-12-06 01:51:27,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:27,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 01:51:27,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 01:51:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-12-06 01:51:27,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:27,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 717 transitions, 28946 flow. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 01:51:27,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:27,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:28,760 INFO L130 PetriNetUnfolder]: 786/1466 cut-off events. [2022-12-06 01:51:28,760 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-06 01:51:28,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30934 conditions, 1466 events. 786/1466 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8564 event pairs, 6 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 24874. Up to 1467 conditions per place. [2022-12-06 01:51:28,771 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 563 selfloop transitions, 74 changer transitions 95/732 dead transitions. [2022-12-06 01:51:28,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 732 transitions, 31022 flow [2022-12-06 01:51:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:51:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:51:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-12-06 01:51:28,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2719298245614035 [2022-12-06 01:51:28,772 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 152 predicate places. [2022-12-06 01:51:28,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:28,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 732 transitions, 31022 flow [2022-12-06 01:51:28,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 732 transitions, 31022 flow [2022-12-06 01:51:28,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:28,796 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:28,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 01:51:28,797 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 732 transitions, 31022 flow [2022-12-06 01:51:28,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 01:51:28,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:28,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:28,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:29,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:29,003 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1751009166, now seen corresponding path program 3 times [2022-12-06 01:51:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:29,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198254524] [2022-12-06 01:51:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:29,834 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 01:51:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:29,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198254524] [2022-12-06 01:51:29,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198254524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:29,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904350424] [2022-12-06 01:51:29,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:51:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:29,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:29,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 01:51:30,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 01:51:30,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:30,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 01:51:30,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:30,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:51:30,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:51:30,199 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:51:30,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 01:51:30,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:30,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:30,369 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 01:51:30,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:31,040 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~o_2~0.base) (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (let ((.cse4 (= .cse0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (.cse2 (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse0)) (.cse1 (forall ((v_ArrVal_1175 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1175))) (= (select (select .cse6 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse6 c_~o_2~0.base) c_~o_2~0.offset)))))) (and (or (< .cse0 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (and (or .cse1 .cse2) (or (forall ((v_ArrVal_1175 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1175))) (< (select (select .cse3 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse3 c_~o_2~0.base) c_~o_2~0.offset)))) .cse4))) (or .cse4 (forall ((v_ArrVal_1175 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1175))) (< (select (select .cse5 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset)))) .cse2) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) .cse1)))) is different from false [2022-12-06 01:51:31,062 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:51:31,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2022-12-06 01:51:31,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:31,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-06 01:51:31,172 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 01:51:31,173 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 191 treesize of output 168 [2022-12-06 01:51:31,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:31,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 108 [2022-12-06 01:51:31,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:31,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 100 [2022-12-06 01:51:32,219 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:51:32,219 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 104 treesize of output 1 [2022-12-06 01:51:32,322 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 01:51:32,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904350424] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:32,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-06 01:51:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276774747] [2022-12-06 01:51:32,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:32,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 01:51:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 01:51:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=793, Unknown=9, NotChecked=58, Total=992 [2022-12-06 01:51:32,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:32,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 732 transitions, 31022 flow. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 01:51:32,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:32,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:32,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:33,781 INFO L130 PetriNetUnfolder]: 897/1660 cut-off events. [2022-12-06 01:51:33,781 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-06 01:51:33,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36686 conditions, 1660 events. 897/1660 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9893 event pairs, 7 based on Foata normal form. 1/1318 useless extension candidates. Maximal degree in co-relation 29651. Up to 1661 conditions per place. [2022-12-06 01:51:33,792 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 531 selfloop transitions, 196 changer transitions 97/824 dead transitions. [2022-12-06 01:51:33,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 824 transitions, 36567 flow [2022-12-06 01:51:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:51:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:51:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-12-06 01:51:33,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3360323886639676 [2022-12-06 01:51:33,794 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 164 predicate places. [2022-12-06 01:51:33,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:33,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 824 transitions, 36567 flow [2022-12-06 01:51:33,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 824 transitions, 36567 flow [2022-12-06 01:51:33,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:33,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:33,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 01:51:33,822 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 824 transitions, 36567 flow [2022-12-06 01:51:33,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 01:51:33,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:33,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:33,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:34,028 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1860730590, now seen corresponding path program 4 times [2022-12-06 01:51:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584130068] [2022-12-06 01:51:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:34,636 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 01:51:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584130068] [2022-12-06 01:51:34,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584130068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533533291] [2022-12-06 01:51:34,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:51:34,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:34,638 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:34,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 01:51:34,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:51:34,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:34,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:34,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:34,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:34,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:51:34,954 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 01:51:34,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:35,450 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:51:35,451 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 130 treesize of output 77 [2022-12-06 01:51:35,499 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 01:51:35,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533533291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:35,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:35,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-06 01:51:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958156893] [2022-12-06 01:51:35,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:35,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 01:51:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 01:51:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-06 01:51:35,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:35,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 824 transitions, 36567 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:51:35,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:35,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:35,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:36,760 INFO L130 PetriNetUnfolder]: 1114/2050 cut-off events. [2022-12-06 01:51:36,760 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2022-12-06 01:51:36,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47338 conditions, 2050 events. 1114/2050 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 12694 event pairs, 4 based on Foata normal form. 2/1604 useless extension candidates. Maximal degree in co-relation 38403. Up to 2051 conditions per place. [2022-12-06 01:51:36,774 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 703 selfloop transitions, 175 changer transitions 102/980 dead transitions. [2022-12-06 01:51:36,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 980 transitions, 45433 flow [2022-12-06 01:51:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:51:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:51:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-12-06 01:51:36,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31100478468899523 [2022-12-06 01:51:36,775 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 174 predicate places. [2022-12-06 01:51:36,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:36,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 980 transitions, 45433 flow [2022-12-06 01:51:36,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 980 transitions, 45433 flow [2022-12-06 01:51:36,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:36,814 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:36,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 01:51:36,815 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 980 transitions, 45433 flow [2022-12-06 01:51:36,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:51:36,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:36,815 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:36,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:37,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:37,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -783126511, now seen corresponding path program 1 times [2022-12-06 01:51:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:37,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371951970] [2022-12-06 01:51:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:51:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371951970] [2022-12-06 01:51:37,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371951970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555835518] [2022-12-06 01:51:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:37,740 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:37,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 01:51:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:37,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 01:51:37,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:38,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:51:38,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 01:51:38,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:38,177 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-06 01:51:38,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 35 [2022-12-06 01:51:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:51:38,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:38,351 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1320 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset))) (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1320 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320))) (= (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset))))))) is different from false [2022-12-06 01:51:38,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:38,392 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 116 treesize of output 148 [2022-12-06 01:51:38,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:38,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-06 01:51:38,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:38,734 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:51:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:51:38,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555835518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:38,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:38,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-12-06 01:51:38,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916901991] [2022-12-06 01:51:38,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:38,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 01:51:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 01:51:38,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2022-12-06 01:51:38,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:38,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 980 transitions, 45433 flow. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:38,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:38,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:38,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:40,388 INFO L130 PetriNetUnfolder]: 1271/2341 cut-off events. [2022-12-06 01:51:40,388 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-06 01:51:40,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56391 conditions, 2341 events. 1271/2341 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 14827 event pairs, 4 based on Foata normal form. 0/1840 useless extension candidates. Maximal degree in co-relation 46125. Up to 2342 conditions per place. [2022-12-06 01:51:40,409 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 758 selfloop transitions, 271 changer transitions 117/1146 dead transitions. [2022-12-06 01:51:40,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 1146 transitions, 55394 flow [2022-12-06 01:51:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:51:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:51:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-12-06 01:51:40,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-06 01:51:40,411 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 187 predicate places. [2022-12-06 01:51:40,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:40,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 1146 transitions, 55394 flow [2022-12-06 01:51:40,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 1146 transitions, 55394 flow [2022-12-06 01:51:40,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:40,448 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:40,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 01:51:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 1146 transitions, 55394 flow [2022-12-06 01:51:40,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:40,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:40,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:40,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:40,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:40,654 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1292528798, now seen corresponding path program 5 times [2022-12-06 01:51:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:40,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809395507] [2022-12-06 01:51:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:41,334 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 01:51:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:41,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809395507] [2022-12-06 01:51:41,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809395507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:41,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757728638] [2022-12-06 01:51:41,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 01:51:41,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:41,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:41,336 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:41,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 01:51:41,464 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:51:41,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:41,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:41,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:41,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:41,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:41,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:51:41,622 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 01:51:41,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:42,154 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:51:42,155 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 58 treesize of output 62 [2022-12-06 01:51:42,198 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:42,198 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 58 treesize of output 1 [2022-12-06 01:51:42,209 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:51:42,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:51:42,214 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:51:42,223 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:42,223 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 58 treesize of output 1 [2022-12-06 01:51:42,258 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 01:51:42,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757728638] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:42,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:42,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 01:51:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656922569] [2022-12-06 01:51:42,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:42,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:51:42,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:51:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:51:42,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:42,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1146 transitions, 55394 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:51:42,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:42,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:42,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:43,760 INFO L130 PetriNetUnfolder]: 1303/2401 cut-off events. [2022-12-06 01:51:43,760 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-06 01:51:43,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60239 conditions, 2401 events. 1303/2401 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 15329 event pairs, 4 based on Foata normal form. 2/1883 useless extension candidates. Maximal degree in co-relation 49095. Up to 2402 conditions per place. [2022-12-06 01:51:43,780 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 936 selfloop transitions, 127 changer transitions 126/1189 dead transitions. [2022-12-06 01:51:43,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1189 transitions, 59854 flow [2022-12-06 01:51:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:51:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:51:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-12-06 01:51:43,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3014354066985646 [2022-12-06 01:51:43,782 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 197 predicate places. [2022-12-06 01:51:43,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:43,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 1189 transitions, 59854 flow [2022-12-06 01:51:43,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 1189 transitions, 59854 flow [2022-12-06 01:51:43,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:43,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:43,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 01:51:43,822 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 1189 transitions, 59854 flow [2022-12-06 01:51:43,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:51:43,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:43,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:43,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:44,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:44,028 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1165114046, now seen corresponding path program 6 times [2022-12-06 01:51:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:44,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784327983] [2022-12-06 01:51:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:44,642 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 01:51:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:44,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784327983] [2022-12-06 01:51:44,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784327983] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:44,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646511678] [2022-12-06 01:51:44,643 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 01:51:44,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:44,645 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:44,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 01:51:44,790 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 01:51:44,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:44,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:44,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:44,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:44,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:51:44,913 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 01:51:44,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:45,274 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-06 01:51:45,274 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 165 treesize of output 107 [2022-12-06 01:51:45,367 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 01:51:45,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646511678] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:45,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:45,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-06 01:51:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782813030] [2022-12-06 01:51:45,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:45,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 01:51:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 01:51:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-06 01:51:45,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:45,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 1189 transitions, 59854 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:51:45,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:45,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:46,828 INFO L130 PetriNetUnfolder]: 1326/2451 cut-off events. [2022-12-06 01:51:46,828 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-12-06 01:51:46,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63947 conditions, 2451 events. 1326/2451 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 15826 event pairs, 4 based on Foata normal form. 2/1919 useless extension candidates. Maximal degree in co-relation 51889. Up to 2452 conditions per place. [2022-12-06 01:51:46,847 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 961 selfloop transitions, 125 changer transitions 129/1215 dead transitions. [2022-12-06 01:51:46,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1215 transitions, 63596 flow [2022-12-06 01:51:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:51:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:51:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2022-12-06 01:51:46,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2822966507177033 [2022-12-06 01:51:46,848 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 207 predicate places. [2022-12-06 01:51:46,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:46,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 1215 transitions, 63596 flow [2022-12-06 01:51:46,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 1215 transitions, 63596 flow [2022-12-06 01:51:46,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:46,885 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:46,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 01:51:46,886 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 1215 transitions, 63596 flow [2022-12-06 01:51:46,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:51:46,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:46,886 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:46,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 01:51:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 01:51:47,087 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash 686763401, now seen corresponding path program 2 times [2022-12-06 01:51:47,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:47,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109024350] [2022-12-06 01:51:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:51:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:47,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109024350] [2022-12-06 01:51:47,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109024350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73591471] [2022-12-06 01:51:47,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:51:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:47,668 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:47,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 01:51:47,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:51:47,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:47,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 01:51:47,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:47,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:51:47,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-06 01:51:48,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:48,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-06 01:51:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:51:48,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:48,368 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1537 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1537))) (= (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset)))))) (forall ((v_ArrVal_1537 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1537))) (let ((.cse1 (select .cse2 ~o_2~0.base))) (or (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (not (= (select .cse1 c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset)))))))) is different from false [2022-12-06 01:51:48,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:48,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-06 01:51:48,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:48,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-06 01:51:48,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:48,423 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 116 treesize of output 148 [2022-12-06 01:51:48,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:48,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-06 01:51:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:51:48,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73591471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:48,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:48,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-12-06 01:51:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399343578] [2022-12-06 01:51:48,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:48,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 01:51:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:48,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 01:51:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2022-12-06 01:51:48,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:48,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 1215 transitions, 63596 flow. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:48,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:48,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:48,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:52,045 INFO L130 PetriNetUnfolder]: 1531/2841 cut-off events. [2022-12-06 01:51:52,045 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-06 01:51:52,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76949 conditions, 2841 events. 1531/2841 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 18830 event pairs, 9 based on Foata normal form. 0/2236 useless extension candidates. Maximal degree in co-relation 63258. Up to 2842 conditions per place. [2022-12-06 01:51:52,070 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 839 selfloop transitions, 439 changer transitions 135/1413 dead transitions. [2022-12-06 01:51:52,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1413 transitions, 76754 flow [2022-12-06 01:51:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 01:51:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 01:51:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 166 transitions. [2022-12-06 01:51:52,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31203007518796994 [2022-12-06 01:51:52,072 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 234 predicate places. [2022-12-06 01:51:52,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:52,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 1413 transitions, 76754 flow [2022-12-06 01:51:52,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 1413 transitions, 76754 flow [2022-12-06 01:51:52,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:52,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:52,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 01:51:52,123 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 1413 transitions, 76754 flow [2022-12-06 01:51:52,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:51:52,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:52,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:52,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 01:51:52,333 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash 576803446, now seen corresponding path program 7 times [2022-12-06 01:51:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:52,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168870914] [2022-12-06 01:51:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:52,904 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 01:51:52,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:52,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168870914] [2022-12-06 01:51:52,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168870914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:52,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270238528] [2022-12-06 01:51:52,905 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 01:51:52,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:52,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:52,906 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:52,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 01:51:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:53,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:53,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:53,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:51:53,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:53,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:51:53,301 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 01:51:53,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:53,651 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-06 01:51:53,652 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 165 treesize of output 107 [2022-12-06 01:51:53,731 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 01:51:53,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270238528] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:53,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:53,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-06 01:51:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513282027] [2022-12-06 01:51:53,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:53,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:51:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:51:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:51:53,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:53,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 1413 transitions, 76754 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:51:53,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:53,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:53,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:55,696 INFO L130 PetriNetUnfolder]: 1530/2851 cut-off events. [2022-12-06 01:51:55,696 INFO L131 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2022-12-06 01:51:55,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80075 conditions, 2851 events. 1530/2851 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 19015 event pairs, 4 based on Foata normal form. 2/2247 useless extension candidates. Maximal degree in co-relation 65711. Up to 2852 conditions per place. [2022-12-06 01:51:55,725 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1138 selfloop transitions, 139 changer transitions 146/1423 dead transitions. [2022-12-06 01:51:55,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1423 transitions, 80152 flow [2022-12-06 01:51:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:51:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:51:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2022-12-06 01:51:55,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2822966507177033 [2022-12-06 01:51:55,727 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 244 predicate places. [2022-12-06 01:51:55,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:55,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 1423 transitions, 80152 flow [2022-12-06 01:51:55,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 1423 transitions, 80152 flow [2022-12-06 01:51:55,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:55,776 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:55,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 01:51:55,777 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 1423 transitions, 80152 flow [2022-12-06 01:51:55,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:51:55,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:55,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:55,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 01:51:55,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 01:51:55,977 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash -301784290, now seen corresponding path program 8 times [2022-12-06 01:51:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:55,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986464401] [2022-12-06 01:51:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:51:56,503 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 01:51:56,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:51:56,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986464401] [2022-12-06 01:51:56,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986464401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:51:56,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885694258] [2022-12-06 01:51:56,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:51:56,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:56,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:51:56,508 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:51:56,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 01:51:56,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:51:56,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:51:56,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:51:56,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:51:56,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:51:56,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:51:56,829 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 01:51:56,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:51:57,266 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:51:57,266 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 58 treesize of output 62 [2022-12-06 01:51:57,314 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:57,315 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 58 treesize of output 1 [2022-12-06 01:51:57,324 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:51:57,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:51:57,329 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:51:57,336 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:51:57,337 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 58 treesize of output 1 [2022-12-06 01:51:57,369 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 01:51:57,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885694258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:51:57,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:51:57,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-06 01:51:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387895182] [2022-12-06 01:51:57,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:51:57,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:51:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:51:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:51:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:51:57,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:51:57,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 1423 transitions, 80152 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:51:57,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:51:57,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:51:57,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:51:59,232 INFO L130 PetriNetUnfolder]: 1538/2871 cut-off events. [2022-12-06 01:51:59,232 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-12-06 01:51:59,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83510 conditions, 2871 events. 1538/2871 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 19208 event pairs, 6 based on Foata normal form. 1/2261 useless extension candidates. Maximal degree in co-relation 68375. Up to 2872 conditions per place. [2022-12-06 01:51:59,256 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1160 selfloop transitions, 127 changer transitions 147/1434 dead transitions. [2022-12-06 01:51:59,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1434 transitions, 83642 flow [2022-12-06 01:51:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:51:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:51:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-12-06 01:51:59,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2679425837320574 [2022-12-06 01:51:59,258 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 254 predicate places. [2022-12-06 01:51:59,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:51:59,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 277 places, 1434 transitions, 83642 flow [2022-12-06 01:51:59,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 277 places, 1434 transitions, 83642 flow [2022-12-06 01:51:59,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:51:59,306 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:51:59,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 01:51:59,310 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 1434 transitions, 83642 flow [2022-12-06 01:51:59,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:51:59,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:51:59,311 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:51:59,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 01:51:59,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:51:59,515 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:51:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:51:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash -917064023, now seen corresponding path program 3 times [2022-12-06 01:51:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:51:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693173969] [2022-12-06 01:51:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:51:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:51:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:00,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693173969] [2022-12-06 01:52:00,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693173969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764641335] [2022-12-06 01:52:00,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:52:00,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:00,257 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:00,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 01:52:00,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 01:52:00,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:00,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 01:52:00,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:00,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:00,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-06 01:52:00,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:00,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-06 01:52:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:00,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:01,019 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1754 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1754))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset))) (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1754 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1754))) (= (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset))))))) is different from false [2022-12-06 01:52:01,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:01,052 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 116 treesize of output 148 [2022-12-06 01:52:01,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:01,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-06 01:52:01,394 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:52:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764641335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:01,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:01,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-12-06 01:52:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241851505] [2022-12-06 01:52:01,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:01,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 01:52:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 01:52:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=457, Unknown=1, NotChecked=44, Total=600 [2022-12-06 01:52:01,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:01,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1434 transitions, 83642 flow. Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:52:01,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:01,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:01,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:07,628 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 46 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 01:52:09,920 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 01:52:12,094 INFO L130 PetriNetUnfolder]: 1532/2855 cut-off events. [2022-12-06 01:52:12,095 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-06 01:52:12,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85899 conditions, 2855 events. 1532/2855 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 19021 event pairs, 6 based on Foata normal form. 0/2248 useless extension candidates. Maximal degree in co-relation 70491. Up to 2856 conditions per place. [2022-12-06 01:52:12,124 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 926 selfloop transitions, 359 changer transitions 147/1432 dead transitions. [2022-12-06 01:52:12,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 1432 transitions, 86384 flow [2022-12-06 01:52:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:52:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:52:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-12-06 01:52:12,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 01:52:12,127 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 265 predicate places. [2022-12-06 01:52:12,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:12,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 1432 transitions, 86384 flow [2022-12-06 01:52:12,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 1432 transitions, 86384 flow [2022-12-06 01:52:12,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:12,176 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:12,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 01:52:12,177 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 1432 transitions, 86384 flow [2022-12-06 01:52:12,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:52:12,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:12,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:12,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:12,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 01:52:12,377 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -145064846, now seen corresponding path program 9 times [2022-12-06 01:52:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534739136] [2022-12-06 01:52:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:12,877 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 01:52:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534739136] [2022-12-06 01:52:12,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534739136] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372162031] [2022-12-06 01:52:12,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:52:12,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:12,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:12,879 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:12,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 01:52:13,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 01:52:13,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:13,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:52:13,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:13,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:13,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:52:13,205 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 01:52:13,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:13,721 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:52:13,721 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 58 treesize of output 62 [2022-12-06 01:52:13,763 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:52:13,763 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 58 treesize of output 1 [2022-12-06 01:52:13,773 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:52:13,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:52:13,778 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:52:13,785 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:52:13,786 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 58 treesize of output 1 [2022-12-06 01:52:13,818 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 01:52:13,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372162031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:13,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:13,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-06 01:52:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827459146] [2022-12-06 01:52:13,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:13,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:52:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:52:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:52:13,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:13,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1432 transitions, 86384 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:52:13,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:13,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:13,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:15,907 INFO L130 PetriNetUnfolder]: 1531/2857 cut-off events. [2022-12-06 01:52:15,908 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-12-06 01:52:15,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88819 conditions, 2857 events. 1531/2857 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 19119 event pairs, 7 based on Foata normal form. 2/2252 useless extension candidates. Maximal degree in co-relation 72839. Up to 2858 conditions per place. [2022-12-06 01:52:15,932 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1144 selfloop transitions, 137 changer transitions 153/1434 dead transitions. [2022-12-06 01:52:15,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 1434 transitions, 89378 flow [2022-12-06 01:52:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:52:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:52:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-12-06 01:52:15,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27631578947368424 [2022-12-06 01:52:15,934 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 276 predicate places. [2022-12-06 01:52:15,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:15,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 1434 transitions, 89378 flow [2022-12-06 01:52:15,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 1434 transitions, 89378 flow [2022-12-06 01:52:15,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:15,987 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:15,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 01:52:15,988 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 1434 transitions, 89378 flow [2022-12-06 01:52:15,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:52:15,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:15,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:15,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:16,194 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1289357758, now seen corresponding path program 10 times [2022-12-06 01:52:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:16,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297574218] [2022-12-06 01:52:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:16,853 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 01:52:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:16,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297574218] [2022-12-06 01:52:16,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297574218] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:16,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993474648] [2022-12-06 01:52:16,854 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:52:16,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:16,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:16,855 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 01:52:17,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:52:17,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:17,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 01:52:17,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:17,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 01:52:17,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:17,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:17,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:52:17,240 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 01:52:17,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:17,777 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1899 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1899))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse1 (select .cse2 c_~o_2~0.offset)) (.cse0 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse0 .cse1) (< (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse1 .cse0)))))) (forall ((v_ArrVal_1899 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1899))) (let ((.cse7 (select .cse8 ~o_2~0.base))) (let ((.cse6 (select .cse7 c_~o_2~0.offset)) (.cse5 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse5 .cse6) (< .cse6 .cse5) (= (select .cse7 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1899 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1899))) (= (select (select .cse9 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset))))) (forall ((v_ArrVal_1899 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1899))) (let ((.cse12 (select .cse13 ~o_2~0.base))) (let ((.cse10 (select .cse12 c_~o_2~0.offset)) (.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse10 .cse11) (< .cse10 .cse11) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse12 .cse3))))))))) is different from false [2022-12-06 01:52:17,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:17,812 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 176 treesize of output 192 [2022-12-06 01:52:17,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:17,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-06 01:52:18,367 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:52:18,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:18,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:18,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:18,380 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-06 01:52:18,380 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 01:52:18,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:18,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:18,389 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-06 01:52:18,389 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 01:52:18,426 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 01:52:18,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993474648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:18,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:18,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-06 01:52:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916902051] [2022-12-06 01:52:18,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:18,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 01:52:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 01:52:18,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=642, Unknown=1, NotChecked=52, Total=812 [2022-12-06 01:52:18,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:18,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 1434 transitions, 89378 flow. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 01:52:18,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:18,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:18,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:22,953 INFO L130 PetriNetUnfolder]: 1553/2896 cut-off events. [2022-12-06 01:52:22,953 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-12-06 01:52:22,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92928 conditions, 2896 events. 1553/2896 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 19399 event pairs, 6 based on Foata normal form. 1/2278 useless extension candidates. Maximal degree in co-relation 76147. Up to 2897 conditions per place. [2022-12-06 01:52:22,980 INFO L137 encePairwiseOnDemand]: 5/19 looper letters, 1146 selfloop transitions, 148 changer transitions 155/1449 dead transitions. [2022-12-06 01:52:22,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 1449 transitions, 93212 flow [2022-12-06 01:52:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:52:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:52:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-12-06 01:52:22,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30701754385964913 [2022-12-06 01:52:22,983 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 287 predicate places. [2022-12-06 01:52:22,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:22,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 310 places, 1449 transitions, 93212 flow [2022-12-06 01:52:23,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 310 places, 1449 transitions, 93212 flow [2022-12-06 01:52:23,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:23,039 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:23,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 01:52:23,040 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 1449 transitions, 93212 flow [2022-12-06 01:52:23,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 01:52:23,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:23,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:23,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:23,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 01:52:23,243 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2025082974, now seen corresponding path program 11 times [2022-12-06 01:52:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:23,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048468435] [2022-12-06 01:52:23,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:24,015 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 01:52:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:24,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048468435] [2022-12-06 01:52:24,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048468435] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:24,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317720987] [2022-12-06 01:52:24,016 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 01:52:24,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:24,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:24,020 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:24,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 01:52:24,178 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:52:24,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:24,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 01:52:24,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:24,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:24,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 01:52:24,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:24,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:24,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:52:24,424 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 01:52:24,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:24,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1972 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1972))) (let ((.cse0 (select .cse4 ~o_2~0.base))) (let ((.cse3 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset)) (.cse2 (select .cse0 c_~o_2~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse0 .cse1)) (< .cse2 .cse3) (= .cse3 .cse2)))))) (forall ((v_ArrVal_1972 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1972))) (let ((.cse5 (select .cse8 ~o_2~0.base))) (let ((.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset)) (.cse7 (select .cse5 c_~o_2~0.offset))) (or (< (select .cse5 .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse6 .cse7) (= .cse6 .cse7)))))) (forall ((v_ArrVal_1972 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1972))) (let ((.cse11 (select .cse12 ~o_2~0.base))) (let ((.cse10 (select .cse11 c_~o_2~0.offset)) (.cse9 (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse9 .cse10) (= (select .cse11 .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse10 .cse9)))))) (or (forall ((v_ArrVal_1972 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1972))) (= (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse13 ~o_2~0.base) c_~o_2~0.offset)))) (< |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) is different from false [2022-12-06 01:52:24,999 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:52:24,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2022-12-06 01:52:25,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:25,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-06 01:52:25,070 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 01:52:25,071 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 176 treesize of output 177 [2022-12-06 01:52:25,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:25,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-06 01:52:25,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:25,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:25,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:25,392 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-06 01:52:25,392 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 01:52:25,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:25,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:25,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:25,401 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-06 01:52:25,401 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 01:52:25,442 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 01:52:25,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317720987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:25,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:25,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-06 01:52:25,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861109080] [2022-12-06 01:52:25,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:25,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 01:52:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 01:52:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2022-12-06 01:52:25,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:25,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1449 transitions, 93212 flow. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 01:52:25,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:25,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:25,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:28,538 INFO L130 PetriNetUnfolder]: 1580/2963 cut-off events. [2022-12-06 01:52:28,538 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2022-12-06 01:52:28,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98044 conditions, 2963 events. 1580/2963 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 20098 event pairs, 5 based on Foata normal form. 1/2337 useless extension candidates. Maximal degree in co-relation 80076. Up to 2964 conditions per place. [2022-12-06 01:52:28,565 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 1158 selfloop transitions, 161 changer transitions 184/1503 dead transitions. [2022-12-06 01:52:28,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 1503 transitions, 99695 flow [2022-12-06 01:52:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:52:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:52:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2022-12-06 01:52:28,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 01:52:28,567 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 299 predicate places. [2022-12-06 01:52:28,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:28,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 322 places, 1503 transitions, 99695 flow [2022-12-06 01:52:28,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 322 places, 1503 transitions, 99695 flow [2022-12-06 01:52:28,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:28,622 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:28,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 01:52:28,623 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 1503 transitions, 99695 flow [2022-12-06 01:52:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 01:52:28,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:28,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:28,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:28,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:28,827 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2064926294, now seen corresponding path program 12 times [2022-12-06 01:52:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:28,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339174523] [2022-12-06 01:52:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:29,295 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 01:52:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:29,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339174523] [2022-12-06 01:52:29,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339174523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:29,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808824900] [2022-12-06 01:52:29,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 01:52:29,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:29,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:29,300 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 01:52:29,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 01:52:29,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:29,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 01:52:29,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:29,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:29,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:29,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 01:52:29,756 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 01:52:29,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:30,284 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:52:30,285 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 58 treesize of output 62 [2022-12-06 01:52:30,314 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:52:30,315 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 58 treesize of output 1 [2022-12-06 01:52:30,325 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-06 01:52:30,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-06 01:52:30,332 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:52:30,342 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-06 01:52:30,342 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 58 treesize of output 1 [2022-12-06 01:52:30,373 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 01:52:30,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808824900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:30,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:30,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-06 01:52:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756579487] [2022-12-06 01:52:30,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:52:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:52:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:52:30,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:30,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 1503 transitions, 99695 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:52:30,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:30,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:30,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:32,640 INFO L130 PetriNetUnfolder]: 1580/2962 cut-off events. [2022-12-06 01:52:32,641 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-12-06 01:52:32,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100974 conditions, 2962 events. 1580/2962 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 20079 event pairs, 4 based on Foata normal form. 1/2336 useless extension candidates. Maximal degree in co-relation 82501. Up to 2963 conditions per place. [2022-12-06 01:52:32,667 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1180 selfloop transitions, 132 changer transitions 190/1502 dead transitions. [2022-12-06 01:52:32,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1502 transitions, 102633 flow [2022-12-06 01:52:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:52:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:52:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-12-06 01:52:32,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 01:52:32,669 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 310 predicate places. [2022-12-06 01:52:32,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:32,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 333 places, 1502 transitions, 102633 flow [2022-12-06 01:52:32,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 333 places, 1502 transitions, 102633 flow [2022-12-06 01:52:32,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:32,725 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:32,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 01:52:32,726 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 1502 transitions, 102633 flow [2022-12-06 01:52:32,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:52:32,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:32,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:32,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:32,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:32,927 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash 421255550, now seen corresponding path program 13 times [2022-12-06 01:52:32,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:32,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908882814] [2022-12-06 01:52:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:33,586 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 01:52:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908882814] [2022-12-06 01:52:33,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908882814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079261212] [2022-12-06 01:52:33,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 01:52:33,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:33,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:33,588 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:33,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 01:52:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:33,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 01:52:33,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:33,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:33,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 01:52:33,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:33,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-06 01:52:34,016 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 01:52:34,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:34,556 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_2117 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2117))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse1 (select .cse2 c_~o_2~0.offset)) (.cse0 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse0 .cse1) (< .cse1 .cse0) (= (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_2117 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2117))) (let ((.cse5 (select .cse8 ~o_2~0.base))) (let ((.cse7 (select .cse5 c_~o_2~0.offset)) (.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (< (select .cse5 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse6 .cse7) (= .cse7 .cse6)))))) (forall ((v_ArrVal_2117 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2117))) (let ((.cse9 (select .cse12 ~o_2~0.base))) (let ((.cse10 (select .cse9 c_~o_2~0.offset)) (.cse11 (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse9 .cse3)) (= .cse10 .cse11) (< .cse10 .cse11)))))) (or (forall ((v_ArrVal_2117 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2117))) (= (select (select .cse13 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset)))) (< |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) is different from false [2022-12-06 01:52:34,611 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 01:52:34,611 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 176 treesize of output 177 [2022-12-06 01:52:34,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:34,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-06 01:52:35,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:35,122 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:52:35,122 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 104 treesize of output 1 [2022-12-06 01:52:35,124 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:52:35,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:35,131 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 01:52:35,131 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 104 treesize of output 1 [2022-12-06 01:52:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:35,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079261212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:35,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:35,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-06 01:52:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671618649] [2022-12-06 01:52:35,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:35,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 01:52:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:35,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 01:52:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2022-12-06 01:52:35,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:35,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1502 transitions, 102633 flow. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:52:35,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:35,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:35,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:37,913 INFO L130 PetriNetUnfolder]: 1580/2961 cut-off events. [2022-12-06 01:52:37,913 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-12-06 01:52:37,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103902 conditions, 2961 events. 1580/2961 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 20039 event pairs, 4 based on Foata normal form. 1/2335 useless extension candidates. Maximal degree in co-relation 84926. Up to 2962 conditions per place. [2022-12-06 01:52:37,940 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 1117 selfloop transitions, 201 changer transitions 205/1523 dead transitions. [2022-12-06 01:52:37,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1523 transitions, 107119 flow [2022-12-06 01:52:37,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:52:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:52:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2022-12-06 01:52:37,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 01:52:37,941 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 321 predicate places. [2022-12-06 01:52:37,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:37,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 344 places, 1523 transitions, 107119 flow [2022-12-06 01:52:37,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 344 places, 1523 transitions, 107119 flow [2022-12-06 01:52:37,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:37,997 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:37,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 01:52:37,998 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 1523 transitions, 107119 flow [2022-12-06 01:52:37,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:52:37,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:37,998 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:38,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:38,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:38,204 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 199251153, now seen corresponding path program 4 times [2022-12-06 01:52:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:38,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087525265] [2022-12-06 01:52:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:38,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087525265] [2022-12-06 01:52:38,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087525265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:38,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565070873] [2022-12-06 01:52:38,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:52:38,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:38,878 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:38,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 01:52:39,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:52:39,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:39,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 01:52:39,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:39,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:52:39,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 01:52:39,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:52:39,309 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 01:52:39,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-06 01:52:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:39,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:39,475 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2190 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2190))) (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2190))) (let ((.cse2 (select .cse1 ~o_2~0.base))) (or (not (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse2 c_~o_2~0.offset))) (= (select .cse2 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-06 01:52:39,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:39,507 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 116 treesize of output 148 [2022-12-06 01:52:39,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:39,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-06 01:52:39,988 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 01:52:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565070873] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:40,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:40,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-12-06 01:52:40,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548005016] [2022-12-06 01:52:40,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 01:52:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 01:52:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=382, Unknown=1, NotChecked=40, Total=506 [2022-12-06 01:52:40,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:40,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1523 transitions, 107119 flow. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:52:40,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:40,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:42,795 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 01:52:45,030 INFO L130 PetriNetUnfolder]: 1570/2941 cut-off events. [2022-12-06 01:52:45,030 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2022-12-06 01:52:45,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106141 conditions, 2941 events. 1570/2941 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 19896 event pairs, 5 based on Foata normal form. 0/2322 useless extension candidates. Maximal degree in co-relation 87063. Up to 2942 conditions per place. [2022-12-06 01:52:45,058 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 833 selfloop transitions, 469 changer transitions 213/1515 dead transitions. [2022-12-06 01:52:45,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1515 transitions, 109583 flow [2022-12-06 01:52:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:52:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:52:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2022-12-06 01:52:45,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37218045112781956 [2022-12-06 01:52:45,060 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 334 predicate places. [2022-12-06 01:52:45,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:45,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 1515 transitions, 109583 flow [2022-12-06 01:52:45,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1515 transitions, 109583 flow [2022-12-06 01:52:45,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:45,130 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:45,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 01:52:45,130 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 1515 transitions, 109583 flow [2022-12-06 01:52:45,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:52:45,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:45,130 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:45,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:45,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 01:52:45,331 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1458633147, now seen corresponding path program 14 times [2022-12-06 01:52:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:45,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143800885] [2022-12-06 01:52:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:45,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143800885] [2022-12-06 01:52:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143800885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:45,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533151176] [2022-12-06 01:52:45,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:52:45,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:45,886 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:45,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 01:52:46,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:52:46,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:46,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:52:46,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:46,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:46,434 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:52:46,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:52:46,473 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:52:46,473 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 32 treesize of output 50 [2022-12-06 01:52:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:46,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533151176] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:46,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:46,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-06 01:52:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654290834] [2022-12-06 01:52:46,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:46,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:52:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:46,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:52:46,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:52:46,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:46,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1515 transitions, 109583 flow. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 01:52:46,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:46,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:46,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:49,659 INFO L130 PetriNetUnfolder]: 1578/2972 cut-off events. [2022-12-06 01:52:49,659 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2022-12-06 01:52:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110238 conditions, 2972 events. 1578/2972 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 20285 event pairs, 4 based on Foata normal form. 0/2353 useless extension candidates. Maximal degree in co-relation 89813. Up to 2973 conditions per place. [2022-12-06 01:52:49,689 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 966 selfloop transitions, 330 changer transitions 238/1534 dead transitions. [2022-12-06 01:52:49,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1534 transitions, 114037 flow [2022-12-06 01:52:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:52:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:52:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-12-06 01:52:49,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38421052631578945 [2022-12-06 01:52:49,691 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 343 predicate places. [2022-12-06 01:52:49,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:49,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 366 places, 1534 transitions, 114037 flow [2022-12-06 01:52:49,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 366 places, 1534 transitions, 114037 flow [2022-12-06 01:52:49,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:49,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:49,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 01:52:49,755 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1534 transitions, 114037 flow [2022-12-06 01:52:49,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 01:52:49,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:49,756 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:49,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:49,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 01:52:49,962 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash -476255483, now seen corresponding path program 15 times [2022-12-06 01:52:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:49,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682202832] [2022-12-06 01:52:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:50,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682202832] [2022-12-06 01:52:50,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682202832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:50,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149537883] [2022-12-06 01:52:50,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:52:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:50,633 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:50,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 01:52:50,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 01:52:50,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:50,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:52:50,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:51,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:51,219 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:52:51,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:52:51,262 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:52:51,263 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 32 treesize of output 50 [2022-12-06 01:52:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:51,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149537883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:51,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:51,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-06 01:52:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612854978] [2022-12-06 01:52:51,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:51,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:52:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:52:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:52:51,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:51,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1534 transitions, 114037 flow. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 01:52:51,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:51,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:51,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:54,697 INFO L130 PetriNetUnfolder]: 1581/2991 cut-off events. [2022-12-06 01:52:54,697 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-12-06 01:52:54,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113939 conditions, 2991 events. 1581/2991 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 20667 event pairs, 4 based on Foata normal form. 0/2372 useless extension candidates. Maximal degree in co-relation 92429. Up to 2992 conditions per place. [2022-12-06 01:52:54,726 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 829 selfloop transitions, 458 changer transitions 256/1543 dead transitions. [2022-12-06 01:52:54,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1543 transitions, 117801 flow [2022-12-06 01:52:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:52:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:52:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2022-12-06 01:52:54,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-06 01:52:54,728 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 355 predicate places. [2022-12-06 01:52:54,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:54,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 378 places, 1543 transitions, 117801 flow [2022-12-06 01:52:54,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 378 places, 1543 transitions, 117801 flow [2022-12-06 01:52:54,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:54,791 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:54,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 01:52:54,792 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 1543 transitions, 117801 flow [2022-12-06 01:52:54,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 01:52:54,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:54,792 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:54,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:54,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:54,993 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:54,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1592570659, now seen corresponding path program 16 times [2022-12-06 01:52:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:54,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459155234] [2022-12-06 01:52:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:55,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459155234] [2022-12-06 01:52:55,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459155234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:55,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313663087] [2022-12-06 01:52:55,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:52:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:55,512 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:55,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 01:52:55,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:52:55,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:52:55,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:52:55,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:52:55,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:52:55,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-06 01:52:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:55,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:52:56,032 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:52:56,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:52:56,076 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:52:56,076 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 32 treesize of output 50 [2022-12-06 01:52:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:56,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313663087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:52:56,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:52:56,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 01:52:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174617273] [2022-12-06 01:52:56,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:52:56,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 01:52:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:52:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 01:52:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-12-06 01:52:56,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:52:56,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1543 transitions, 117801 flow. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 01:52:56,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:52:56,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:52:56,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:52:58,893 INFO L130 PetriNetUnfolder]: 1599/3033 cut-off events. [2022-12-06 01:52:58,893 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 01:52:58,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118575 conditions, 3033 events. 1599/3033 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 21028 event pairs, 4 based on Foata normal form. 0/2404 useless extension candidates. Maximal degree in co-relation 95718. Up to 3034 conditions per place. [2022-12-06 01:52:58,929 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 936 selfloop transitions, 387 changer transitions 256/1579 dead transitions. [2022-12-06 01:52:58,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1579 transitions, 123707 flow [2022-12-06 01:52:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:52:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:52:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 103 transitions. [2022-12-06 01:52:58,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36140350877192984 [2022-12-06 01:52:58,930 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 369 predicate places. [2022-12-06 01:52:58,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:52:58,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 392 places, 1579 transitions, 123707 flow [2022-12-06 01:52:59,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 1579 transitions, 123707 flow [2022-12-06 01:52:59,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:52:59,128 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:52:59,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 01:52:59,128 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 1579 transitions, 123707 flow [2022-12-06 01:52:59,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 01:52:59,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:52:59,128 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:52:59,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 01:52:59,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 01:52:59,330 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:52:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:52:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 11256765, now seen corresponding path program 17 times [2022-12-06 01:52:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:52:59,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142629052] [2022-12-06 01:52:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:52:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:52:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:52:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:52:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:52:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142629052] [2022-12-06 01:52:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142629052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:52:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182349740] [2022-12-06 01:52:59,942 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 01:52:59,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:52:59,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:52:59,944 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:52:59,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 01:53:00,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:53:00,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:53:00,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:53:00,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:53:00,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:53:00,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-06 01:53:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:00,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:53:00,492 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:53:00,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:53:00,527 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:53:00,528 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 32 treesize of output 50 [2022-12-06 01:53:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:00,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182349740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:53:00,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:53:00,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-06 01:53:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893071342] [2022-12-06 01:53:00,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:53:00,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 01:53:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:00,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 01:53:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-06 01:53:00,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:53:00,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1579 transitions, 123707 flow. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:53:00,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:00,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:53:00,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:53:03,905 INFO L130 PetriNetUnfolder]: 1582/2998 cut-off events. [2022-12-06 01:53:03,905 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2022-12-06 01:53:03,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120203 conditions, 2998 events. 1582/2998 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 20660 event pairs, 7 based on Foata normal form. 0/2383 useless extension candidates. Maximal degree in co-relation 97731. Up to 2999 conditions per place. [2022-12-06 01:53:03,938 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 866 selfloop transitions, 435 changer transitions 263/1564 dead transitions. [2022-12-06 01:53:03,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 1564 transitions, 125653 flow [2022-12-06 01:53:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 01:53:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 01:53:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-12-06 01:53:03,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.284688995215311 [2022-12-06 01:53:03,940 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 390 predicate places. [2022-12-06 01:53:03,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:53:03,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 413 places, 1564 transitions, 125653 flow [2022-12-06 01:53:04,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 413 places, 1564 transitions, 125653 flow [2022-12-06 01:53:04,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:53:04,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, 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_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 01:53:04,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, 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_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 01:53:04,250 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:53:04,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 01:53:04,251 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 1564 transitions, 125657 flow [2022-12-06 01:53:04,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:53:04,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:53:04,251 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:53:04,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 01:53:04,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 01:53:04,457 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:53:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:53:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1626685481, now seen corresponding path program 18 times [2022-12-06 01:53:04,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:53:04,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747618480] [2022-12-06 01:53:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:53:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:53:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:53:05,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747618480] [2022-12-06 01:53:05,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747618480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:53:05,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368220469] [2022-12-06 01:53:05,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 01:53:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:53:05,461 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:53:05,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 01:53:05,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 01:53:05,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:53:05,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:53:05,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:53:05,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:53:05,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:53:05,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-06 01:53:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:05,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:53:06,107 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:53:06,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:53:06,142 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:53:06,142 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 32 treesize of output 50 [2022-12-06 01:53:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:06,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368220469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:53:06,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:53:06,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2022-12-06 01:53:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961497093] [2022-12-06 01:53:06,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:53:06,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 01:53:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:06,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 01:53:06,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-12-06 01:53:06,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:53:06,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1564 transitions, 125657 flow. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:53:06,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:06,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:53:06,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:53:11,807 INFO L130 PetriNetUnfolder]: 3247/6163 cut-off events. [2022-12-06 01:53:11,807 INFO L131 PetriNetUnfolder]: For 674/674 co-relation queries the response was YES. [2022-12-06 01:53:11,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253224 conditions, 6163 events. 3247/6163 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 48557 event pairs, 16 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 102799. Up to 6164 conditions per place. [2022-12-06 01:53:11,870 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 1900 selfloop transitions, 783 changer transitions 526/3209 dead transitions. [2022-12-06 01:53:11,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 3209 transitions, 264236 flow [2022-12-06 01:53:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 01:53:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 01:53:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 167 transitions. [2022-12-06 01:53:11,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3180952380952381 [2022-12-06 01:53:11,871 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 414 predicate places. [2022-12-06 01:53:11,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:53:11,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 3209 transitions, 264236 flow [2022-12-06 01:53:12,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 437 places, 3209 transitions, 264236 flow [2022-12-06 01:53:12,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:53:12,162 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:53:12,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-06 01:53:12,162 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 3209 transitions, 264236 flow [2022-12-06 01:53:12,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:53:12,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:53:12,163 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:53:12,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 01:53:12,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 01:53:12,363 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:53:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:53:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1064454391, now seen corresponding path program 19 times [2022-12-06 01:53:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:53:12,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763499716] [2022-12-06 01:53:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:53:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:53:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:12,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:53:12,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763499716] [2022-12-06 01:53:12,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763499716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:53:12,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319810502] [2022-12-06 01:53:12,837 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 01:53:12,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:12,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:53:12,839 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:53:12,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 01:53:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:13,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:53:13,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:53:13,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:53:13,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:53:13,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-06 01:53:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:13,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:53:13,346 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:53:13,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:53:13,382 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:53:13,382 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 32 treesize of output 50 [2022-12-06 01:53:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:13,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319810502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:53:13,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:53:13,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-06 01:53:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400262512] [2022-12-06 01:53:13,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:53:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 01:53:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 01:53:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-06 01:53:13,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:53:13,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 3209 transitions, 264236 flow. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:53:13,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:13,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:53:13,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:53:23,627 INFO L130 PetriNetUnfolder]: 3301/6253 cut-off events. [2022-12-06 01:53:23,627 INFO L131 PetriNetUnfolder]: For 663/663 co-relation queries the response was YES. [2022-12-06 01:53:23,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263162 conditions, 6253 events. 3301/6253 cut-off events. For 663/663 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 49312 event pairs, 18 based on Foata normal form. 0/4979 useless extension candidates. Maximal degree in co-relation 107783. Up to 6254 conditions per place. [2022-12-06 01:53:23,692 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 2002 selfloop transitions, 707 changer transitions 542/3251 dead transitions. [2022-12-06 01:53:23,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 3251 transitions, 274170 flow [2022-12-06 01:53:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 01:53:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 01:53:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2022-12-06 01:53:23,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27380952380952384 [2022-12-06 01:53:23,693 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 429 predicate places. [2022-12-06 01:53:23,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:53:23,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 3251 transitions, 274170 flow [2022-12-06 01:53:23,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 452 places, 3251 transitions, 274170 flow [2022-12-06 01:53:23,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:53:23,842 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:53:23,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 01:53:23,843 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 3251 transitions, 274170 flow [2022-12-06 01:53:23,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:53:23,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:53:23,843 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:53:23,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 01:53:24,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:24,044 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:53:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:53:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 137280485, now seen corresponding path program 20 times [2022-12-06 01:53:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:53:24,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477240621] [2022-12-06 01:53:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:53:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:53:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:53:24,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477240621] [2022-12-06 01:53:24,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477240621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:53:24,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404537967] [2022-12-06 01:53:24,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:53:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:24,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:53:24,504 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:53:24,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 01:53:24,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:53:24,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:53:24,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 01:53:24,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:53:24,810 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 01:53:24,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-06 01:53:24,818 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:53:24,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 01:53:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:24,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:53:25,248 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:53:25,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:53:25,284 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:53:25,284 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 32 treesize of output 50 [2022-12-06 01:53:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:25,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404537967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:53:25,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:53:25,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-12-06 01:53:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746818719] [2022-12-06 01:53:25,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:53:25,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 01:53:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 01:53:25,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:53:25,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:53:25,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 3251 transitions, 274170 flow. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:53:25,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:25,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:53:25,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:53:37,466 INFO L130 PetriNetUnfolder]: 3565/6861 cut-off events. [2022-12-06 01:53:37,466 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-12-06 01:53:37,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295632 conditions, 6861 events. 3565/6861 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 55725 event pairs, 15 based on Foata normal form. 4/5445 useless extension candidates. Maximal degree in co-relation 119034. Up to 6862 conditions per place. [2022-12-06 01:53:37,541 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 2172 selfloop transitions, 857 changer transitions 560/3589 dead transitions. [2022-12-06 01:53:37,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 3589 transitions, 309920 flow [2022-12-06 01:53:37,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 01:53:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 01:53:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 160 transitions. [2022-12-06 01:53:37,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.272108843537415 [2022-12-06 01:53:37,543 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 456 predicate places. [2022-12-06 01:53:37,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:53:37,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 479 places, 3589 transitions, 309920 flow [2022-12-06 01:53:37,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 479 places, 3589 transitions, 309920 flow [2022-12-06 01:53:37,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:53:37,711 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:53:37,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 01:53:37,712 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 3589 transitions, 309920 flow [2022-12-06 01:53:37,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 01:53:37,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:53:37,712 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:53:37,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-06 01:53:37,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:37,916 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:53:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:53:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1741107909, now seen corresponding path program 21 times [2022-12-06 01:53:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:53:37,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284530472] [2022-12-06 01:53:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:53:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:53:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:53:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284530472] [2022-12-06 01:53:38,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284530472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:53:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738687756] [2022-12-06 01:53:38,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:53:38,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:38,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:53:38,564 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:53:38,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 01:53:38,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 01:53:38,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:53:38,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:53:38,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:53:38,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:53:38,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-06 01:53:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:38,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:53:39,142 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:53:39,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:53:39,178 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:53:39,179 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 32 treesize of output 50 [2022-12-06 01:53:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:39,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738687756] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:53:39,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:53:39,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 01:53:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585614185] [2022-12-06 01:53:39,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:53:39,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 01:53:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 01:53:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-06 01:53:39,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:53:39,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 3589 transitions, 309920 flow. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:53:39,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:39,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:53:39,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:53:51,217 INFO L130 PetriNetUnfolder]: 3497/6721 cut-off events. [2022-12-06 01:53:51,218 INFO L131 PetriNetUnfolder]: For 733/733 co-relation queries the response was YES. [2022-12-06 01:53:51,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296310 conditions, 6721 events. 3497/6721 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 54386 event pairs, 16 based on Foata normal form. 0/5357 useless extension candidates. Maximal degree in co-relation 120833. Up to 6722 conditions per place. [2022-12-06 01:53:51,298 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 2212 selfloop transitions, 733 changer transitions 574/3519 dead transitions. [2022-12-06 01:53:51,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 3519 transitions, 310878 flow [2022-12-06 01:53:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:53:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:53:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2022-12-06 01:53:51,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.273015873015873 [2022-12-06 01:53:51,299 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 467 predicate places. [2022-12-06 01:53:51,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:53:51,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 490 places, 3519 transitions, 310878 flow [2022-12-06 01:53:51,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 490 places, 3519 transitions, 310878 flow [2022-12-06 01:53:51,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:53:51,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:53:51,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 01:53:51,481 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 3519 transitions, 310878 flow [2022-12-06 01:53:51,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:53:51,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:53:51,482 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:53:51,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 01:53:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-06 01:53:51,682 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:53:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:53:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 146794821, now seen corresponding path program 22 times [2022-12-06 01:53:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:53:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414602062] [2022-12-06 01:53:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:53:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:53:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:53:52,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414602062] [2022-12-06 01:53:52,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414602062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:53:52,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685650668] [2022-12-06 01:53:52,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:53:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:53:52,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:53:52,276 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:53:52,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 01:53:52,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:53:52,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:53:52,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:53:52,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:53:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:52,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:53:52,843 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:53:52,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:53:52,894 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:53:52,895 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 32 treesize of output 50 [2022-12-06 01:53:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:53:52,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685650668] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:53:52,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:53:52,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-06 01:53:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691654085] [2022-12-06 01:53:52,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:53:52,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 01:53:52,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 01:53:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-06 01:53:52,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:53:52,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 3519 transitions, 310878 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:53:52,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:52,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:53:52,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:54:05,804 INFO L130 PetriNetUnfolder]: 3543/6779 cut-off events. [2022-12-06 01:54:05,805 INFO L131 PetriNetUnfolder]: For 711/711 co-relation queries the response was YES. [2022-12-06 01:54:05,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305630 conditions, 6779 events. 3543/6779 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 54717 event pairs, 16 based on Foata normal form. 0/5403 useless extension candidates. Maximal degree in co-relation 125603. Up to 6780 conditions per place. [2022-12-06 01:54:05,882 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 2132 selfloop transitions, 843 changer transitions 574/3549 dead transitions. [2022-12-06 01:54:05,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 3549 transitions, 320592 flow [2022-12-06 01:54:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:54:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:54:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-12-06 01:54:05,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29004329004329005 [2022-12-06 01:54:05,884 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 476 predicate places. [2022-12-06 01:54:05,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:54:05,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 499 places, 3549 transitions, 320592 flow [2022-12-06 01:54:06,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 499 places, 3549 transitions, 320592 flow [2022-12-06 01:54:06,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:54:06,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:54:06,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 01:54:06,085 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 3549 transitions, 320592 flow [2022-12-06 01:54:06,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:54:06,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:54:06,085 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:54:06,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 01:54:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 01:54:06,300 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:54:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:54:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1688452227, now seen corresponding path program 23 times [2022-12-06 01:54:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:54:06,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194384313] [2022-12-06 01:54:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:54:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:54:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:54:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:54:07,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194384313] [2022-12-06 01:54:07,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194384313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:54:07,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564358068] [2022-12-06 01:54:07,066 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 01:54:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:54:07,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:54:07,067 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:54:07,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 01:54:07,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:54:07,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:54:07,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:54:07,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:54:07,420 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 01:54:07,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-06 01:54:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:07,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:54:07,571 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:54:07,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 01:54:07,607 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:54:07,607 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 32 treesize of output 50 [2022-12-06 01:54:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:07,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564358068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:54:07,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:54:07,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-12-06 01:54:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316767838] [2022-12-06 01:54:07,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:54:07,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:54:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:54:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:54:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:54:07,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:54:07,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 3549 transitions, 320592 flow. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:54:07,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:54:07,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:54:07,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:54:20,666 INFO L130 PetriNetUnfolder]: 3531/6765 cut-off events. [2022-12-06 01:54:20,666 INFO L131 PetriNetUnfolder]: For 730/730 co-relation queries the response was YES. [2022-12-06 01:54:20,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311766 conditions, 6765 events. 3531/6765 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 54747 event pairs, 12 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 128301. Up to 6766 conditions per place. [2022-12-06 01:54:20,746 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 2142 selfloop transitions, 799 changer transitions 606/3547 dead transitions. [2022-12-06 01:54:20,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 3547 transitions, 327512 flow [2022-12-06 01:54:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:54:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:54:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2022-12-06 01:54:20,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2987012987012987 [2022-12-06 01:54:20,747 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 486 predicate places. [2022-12-06 01:54:20,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:54:20,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 509 places, 3547 transitions, 327512 flow [2022-12-06 01:54:20,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 509 places, 3547 transitions, 327512 flow [2022-12-06 01:54:20,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:54:20,965 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:54:20,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 01:54:20,966 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 3547 transitions, 327512 flow [2022-12-06 01:54:20,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:54:20,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:54:20,966 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:54:20,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 01:54:21,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 01:54:21,173 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:54:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:54:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash 498204093, now seen corresponding path program 24 times [2022-12-06 01:54:21,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:54:21,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47895390] [2022-12-06 01:54:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:54:21,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:54:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:54:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:54:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47895390] [2022-12-06 01:54:21,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47895390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:54:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380772902] [2022-12-06 01:54:21,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 01:54:21,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:54:21,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:54:21,703 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:54:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 01:54:22,050 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 01:54:22,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:54:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:54:22,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:54:22,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:54:22,223 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 01:54:22,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-06 01:54:22,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 01:54:22,231 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:54:22,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 01:54:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:22,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:54:22,497 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 01:54:22,497 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 82 treesize of output 107 [2022-12-06 01:54:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:22,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380772902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:54:22,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:54:22,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-06 01:54:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58207164] [2022-12-06 01:54:22,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:54:22,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:54:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:54:22,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:54:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:54:22,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:54:22,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 3547 transitions, 327512 flow. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 01:54:22,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:54:22,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:54:22,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:54:38,898 INFO L130 PetriNetUnfolder]: 3657/7011 cut-off events. [2022-12-06 01:54:38,898 INFO L131 PetriNetUnfolder]: For 722/722 co-relation queries the response was YES. [2022-12-06 01:54:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330106 conditions, 7011 events. 3657/7011 cut-off events. For 722/722 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 57240 event pairs, 8 based on Foata normal form. 0/5605 useless extension candidates. Maximal degree in co-relation 136306. Up to 7012 conditions per place. [2022-12-06 01:54:38,985 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 2230 selfloop transitions, 805 changer transitions 620/3655 dead transitions. [2022-12-06 01:54:38,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 3655 transitions, 344782 flow [2022-12-06 01:54:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 01:54:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 01:54:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions. [2022-12-06 01:54:38,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2751322751322751 [2022-12-06 01:54:38,988 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 503 predicate places. [2022-12-06 01:54:38,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:54:38,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 526 places, 3655 transitions, 344782 flow [2022-12-06 01:54:39,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 526 places, 3655 transitions, 344782 flow [2022-12-06 01:54:39,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:54:39,215 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:54:39,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 01:54:39,216 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 3655 transitions, 344782 flow [2022-12-06 01:54:39,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 01:54:39,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:54:39,216 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:54:39,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-06 01:54:39,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 01:54:39,417 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:54:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:54:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 370789341, now seen corresponding path program 25 times [2022-12-06 01:54:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:54:39,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553772325] [2022-12-06 01:54:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:54:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:54:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:54:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:54:40,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553772325] [2022-12-06 01:54:40,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553772325] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:54:40,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747217883] [2022-12-06 01:54:40,105 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 01:54:40,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:54:40,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:54:40,107 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:54:40,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 01:54:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:54:40,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:54:40,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:54:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:40,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:54:40,697 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 01:54:40,697 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 82 treesize of output 107 [2022-12-06 01:54:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747217883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:54:40,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:54:40,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-06 01:54:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174808476] [2022-12-06 01:54:40,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:54:40,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 01:54:40,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:54:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 01:54:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-06 01:54:40,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:54:40,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 3655 transitions, 344782 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:54:40,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:54:40,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:54:40,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:54:56,774 INFO L130 PetriNetUnfolder]: 3793/7243 cut-off events. [2022-12-06 01:54:56,774 INFO L131 PetriNetUnfolder]: For 733/733 co-relation queries the response was YES. [2022-12-06 01:54:56,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348254 conditions, 7243 events. 3793/7243 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 59087 event pairs, 14 based on Foata normal form. 0/5789 useless extension candidates. Maximal degree in co-relation 144773. Up to 7244 conditions per place. [2022-12-06 01:54:56,867 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 2216 selfloop transitions, 923 changer transitions 620/3759 dead transitions. [2022-12-06 01:54:56,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 3759 transitions, 362076 flow [2022-12-06 01:54:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:54:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:54:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2022-12-06 01:54:56,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2585034013605442 [2022-12-06 01:54:56,869 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 516 predicate places. [2022-12-06 01:54:56,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:54:56,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 539 places, 3759 transitions, 362076 flow [2022-12-06 01:54:57,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 539 places, 3759 transitions, 362076 flow [2022-12-06 01:54:57,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:54:57,094 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:54:57,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 01:54:57,095 INFO L495 AbstractCegarLoop]: Abstraction has has 539 places, 3759 transitions, 362076 flow [2022-12-06 01:54:57,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:54:57,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:54:57,095 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:54:57,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 01:54:57,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:54:57,297 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:54:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:54:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1105623331, now seen corresponding path program 26 times [2022-12-06 01:54:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:54:57,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288085690] [2022-12-06 01:54:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:54:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:54:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:54:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:54:57,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288085690] [2022-12-06 01:54:57,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288085690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:54:57,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090555321] [2022-12-06 01:54:57,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:54:57,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:54:57,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:54:57,888 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:54:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 01:54:58,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:54:58,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:54:58,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:54:58,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:54:58,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:54:58,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-06 01:54:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:58,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:54:58,488 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 01:54:58,488 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 82 treesize of output 107 [2022-12-06 01:54:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:54:58,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090555321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:54:58,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:54:58,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-06 01:54:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231143293] [2022-12-06 01:54:58,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:54:58,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:54:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:54:58,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:54:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:54:58,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:54:58,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 3759 transitions, 362076 flow. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:54:58,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:54:58,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:54:58,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:55:16,500 INFO L130 PetriNetUnfolder]: 3853/7331 cut-off events. [2022-12-06 01:55:16,500 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-06 01:55:16,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359804 conditions, 7331 events. 3853/7331 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 59797 event pairs, 11 based on Foata normal form. 0/5861 useless extension candidates. Maximal degree in co-relation 150336. Up to 7332 conditions per place. [2022-12-06 01:55:16,603 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 2220 selfloop transitions, 953 changer transitions 620/3793 dead transitions. [2022-12-06 01:55:16,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 3793 transitions, 372914 flow [2022-12-06 01:55:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 01:55:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 01:55:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2022-12-06 01:55:16,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2471655328798186 [2022-12-06 01:55:16,606 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 536 predicate places. [2022-12-06 01:55:16,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:55:16,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 559 places, 3793 transitions, 372914 flow [2022-12-06 01:55:16,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 559 places, 3793 transitions, 372914 flow [2022-12-06 01:55:16,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:55:16,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:55:16,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 326 [2022-12-06 01:55:16,932 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 3793 transitions, 372914 flow [2022-12-06 01:55:16,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:55:16,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:55:16,933 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:55:16,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 01:55:17,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 01:55:17,143 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:55:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:55:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1750668611, now seen corresponding path program 27 times [2022-12-06 01:55:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:55:17,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481089944] [2022-12-06 01:55:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:55:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:55:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:55:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:55:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:55:17,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481089944] [2022-12-06 01:55:17,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481089944] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:55:17,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101826114] [2022-12-06 01:55:17,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:55:17,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:55:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:55:17,653 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:55:17,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 01:55:17,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 01:55:17,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:55:17,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:55:17,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:55:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:55:18,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:55:18,286 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:55:18,286 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 40 treesize of output 60 [2022-12-06 01:55:18,301 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:55:18,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 01:55:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:55:18,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101826114] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:55:18,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:55:18,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 01:55:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964493836] [2022-12-06 01:55:18,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:55:18,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 01:55:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:55:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 01:55:18,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-06 01:55:18,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:55:18,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 3793 transitions, 372914 flow. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:55:18,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:55:18,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:55:18,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:55:39,132 INFO L130 PetriNetUnfolder]: 3839/7317 cut-off events. [2022-12-06 01:55:39,132 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2022-12-06 01:55:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366436 conditions, 7317 events. 3839/7317 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 59737 event pairs, 10 based on Foata normal form. 0/5861 useless extension candidates. Maximal degree in co-relation 153253. Up to 7318 conditions per place. [2022-12-06 01:55:39,240 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 2278 selfloop transitions, 863 changer transitions 648/3789 dead transitions. [2022-12-06 01:55:39,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 3789 transitions, 380100 flow [2022-12-06 01:55:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:55:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:55:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 68 transitions. [2022-12-06 01:55:39,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2943722943722944 [2022-12-06 01:55:39,241 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 546 predicate places. [2022-12-06 01:55:39,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:55:39,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 569 places, 3789 transitions, 380100 flow [2022-12-06 01:55:39,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 569 places, 3789 transitions, 380100 flow [2022-12-06 01:55:39,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:55:39,682 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:55:39,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 440 [2022-12-06 01:55:39,682 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 3789 transitions, 380100 flow [2022-12-06 01:55:39,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:55:39,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:55:39,683 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:55:39,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-06 01:55:39,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 01:55:39,883 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:55:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:55:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -61421487, now seen corresponding path program 28 times [2022-12-06 01:55:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:55:39,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426666274] [2022-12-06 01:55:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:55:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:55:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:55:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:55:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:55:40,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426666274] [2022-12-06 01:55:40,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426666274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:55:40,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118859560] [2022-12-06 01:55:40,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:55:40,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:55:40,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:55:40,752 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:55:40,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 01:55:40,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:55:40,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:55:40,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:55:40,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:55:41,090 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:55:41,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 14 [2022-12-06 01:55:41,103 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 01:55:41,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2022-12-06 01:55:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:55:41,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:55:41,361 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:55:41,361 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 40 treesize of output 60 [2022-12-06 01:55:41,375 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:55:41,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 01:55:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:55:41,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118859560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:55:41,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:55:41,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-12-06 01:55:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030478701] [2022-12-06 01:55:41,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:55:41,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 01:55:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:55:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 01:55:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-06 01:55:41,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:55:41,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 3789 transitions, 380100 flow. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:55:41,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:55:41,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:55:41,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:56:03,381 INFO L130 PetriNetUnfolder]: 3931/7489 cut-off events. [2022-12-06 01:56:03,381 INFO L131 PetriNetUnfolder]: For 748/748 co-relation queries the response was YES. [2022-12-06 01:56:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382538 conditions, 7489 events. 3931/7489 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 61434 event pairs, 10 based on Foata normal form. 0/5989 useless extension candidates. Maximal degree in co-relation 159683. Up to 7490 conditions per place. [2022-12-06 01:56:03,491 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 2264 selfloop transitions, 947 changer transitions 648/3859 dead transitions. [2022-12-06 01:56:03,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 3859 transitions, 394842 flow [2022-12-06 01:56:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 01:56:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 01:56:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 201 transitions. [2022-12-06 01:56:03,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27346938775510204 [2022-12-06 01:56:03,493 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 580 predicate places. [2022-12-06 01:56:03,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:56:03,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 603 places, 3859 transitions, 394842 flow [2022-12-06 01:56:03,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 603 places, 3859 transitions, 394842 flow [2022-12-06 01:56:03,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:56:03,797 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:56:03,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-06 01:56:03,797 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 3859 transitions, 394842 flow [2022-12-06 01:56:03,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:56:03,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:56:03,797 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:56:03,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-06 01:56:03,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 01:56:03,998 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:56:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:56:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1427983509, now seen corresponding path program 29 times [2022-12-06 01:56:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:56:03,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719571717] [2022-12-06 01:56:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:56:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:56:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:56:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:56:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719571717] [2022-12-06 01:56:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719571717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:56:04,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861179114] [2022-12-06 01:56:04,702 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 01:56:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:56:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:56:04,703 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:56:04,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 01:56:05,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 01:56:05,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:56:05,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 01:56:05,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:56:05,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:56:05,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2022-12-06 01:56:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:05,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:56:05,729 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:56:05,729 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 40 treesize of output 60 [2022-12-06 01:56:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:05,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861179114] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:56:05,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:56:05,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-12-06 01:56:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254647718] [2022-12-06 01:56:05,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:56:05,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 01:56:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:56:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 01:56:05,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-12-06 01:56:05,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:56:05,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 3859 transitions, 394842 flow. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 01:56:05,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:56:05,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:56:05,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:56:28,272 INFO L130 PetriNetUnfolder]: 3995/7601 cut-off events. [2022-12-06 01:56:28,273 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-12-06 01:56:28,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395852 conditions, 7601 events. 3995/7601 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 62552 event pairs, 14 based on Foata normal form. 0/6077 useless extension candidates. Maximal degree in co-relation 165725. Up to 7602 conditions per place. [2022-12-06 01:56:28,385 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 2308 selfloop transitions, 959 changer transitions 648/3915 dead transitions. [2022-12-06 01:56:28,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 3915 transitions, 408384 flow [2022-12-06 01:56:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:56:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:56:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-06 01:56:28,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.272108843537415 [2022-12-06 01:56:28,386 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 593 predicate places. [2022-12-06 01:56:28,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:56:28,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 616 places, 3915 transitions, 408384 flow [2022-12-06 01:56:28,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 616 places, 3915 transitions, 408384 flow [2022-12-06 01:56:28,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:56:28,696 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:56:28,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 01:56:28,697 INFO L495 AbstractCegarLoop]: Abstraction has has 616 places, 3915 transitions, 408384 flow [2022-12-06 01:56:28,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 01:56:28,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:56:28,697 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:56:28,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-06 01:56:28,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:56:28,898 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:56:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:56:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1096108995, now seen corresponding path program 30 times [2022-12-06 01:56:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:56:28,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943082599] [2022-12-06 01:56:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:56:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:56:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:56:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:56:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943082599] [2022-12-06 01:56:29,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943082599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:56:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281341958] [2022-12-06 01:56:29,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 01:56:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:56:29,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:56:29,475 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:56:29,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 01:56:29,724 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 01:56:29,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:56:29,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:56:29,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:56:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:29,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:56:30,046 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 01:56:30,047 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 82 treesize of output 107 [2022-12-06 01:56:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:30,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281341958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:56:30,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:56:30,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-06 01:56:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291067310] [2022-12-06 01:56:30,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:56:30,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 01:56:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:56:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 01:56:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-12-06 01:56:30,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:56:30,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 3915 transitions, 408384 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 01:56:30,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:56:30,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:56:30,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:56:53,872 INFO L130 PetriNetUnfolder]: 4027/7657 cut-off events. [2022-12-06 01:56:53,873 INFO L131 PetriNetUnfolder]: For 735/735 co-relation queries the response was YES. [2022-12-06 01:56:53,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406416 conditions, 7657 events. 4027/7657 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 62913 event pairs, 14 based on Foata normal form. 0/6121 useless extension candidates. Maximal degree in co-relation 170819. Up to 7658 conditions per place. [2022-12-06 01:56:53,987 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 2336 selfloop transitions, 981 changer transitions 648/3965 dead transitions. [2022-12-06 01:56:53,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 3965 transitions, 421502 flow [2022-12-06 01:56:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 01:56:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 01:56:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2022-12-06 01:56:53,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 01:56:53,993 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 606 predicate places. [2022-12-06 01:56:53,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:56:53,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 629 places, 3965 transitions, 421502 flow [2022-12-06 01:56:54,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 629 places, 3965 transitions, 421502 flow [2022-12-06 01:56:54,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:56:54,375 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:56:54,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-06 01:56:54,375 INFO L495 AbstractCegarLoop]: Abstraction has has 629 places, 3965 transitions, 421502 flow [2022-12-06 01:56:54,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 01:56:54,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:56:54,376 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:56:54,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-06 01:56:54,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:56:54,577 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:56:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:56:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash -51907151, now seen corresponding path program 31 times [2022-12-06 01:56:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:56:54,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760969598] [2022-12-06 01:56:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:56:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:56:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:56:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:56:55,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760969598] [2022-12-06 01:56:55,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760969598] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:56:55,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861812467] [2022-12-06 01:56:55,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 01:56:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:56:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:56:55,192 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:56:55,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 01:56:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:56:55,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:56:55,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:56:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:55,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:56:55,826 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:56:55,826 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 40 treesize of output 60 [2022-12-06 01:56:55,842 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:56:55,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 01:56:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:56:55,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861812467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:56:55,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:56:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-06 01:56:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916464186] [2022-12-06 01:56:55,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:56:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 01:56:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:56:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 01:56:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-06 01:56:55,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:56:55,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 3965 transitions, 421502 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:56:55,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:56:55,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:56:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:57:19,668 INFO L130 PetriNetUnfolder]: 4055/7697 cut-off events. [2022-12-06 01:57:19,668 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2022-12-06 01:57:19,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416228 conditions, 7697 events. 4055/7697 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 63255 event pairs, 10 based on Foata normal form. 0/6161 useless extension candidates. Maximal degree in co-relation 175661. Up to 7698 conditions per place. [2022-12-06 01:57:19,787 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 2360 selfloop transitions, 973 changer transitions 648/3981 dead transitions. [2022-12-06 01:57:19,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 3981 transitions, 431148 flow [2022-12-06 01:57:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 01:57:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 01:57:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-12-06 01:57:19,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26587301587301587 [2022-12-06 01:57:19,789 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 615 predicate places. [2022-12-06 01:57:19,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:57:19,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 638 places, 3981 transitions, 431148 flow [2022-12-06 01:57:20,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 638 places, 3981 transitions, 431148 flow [2022-12-06 01:57:20,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:57:20,261 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:57:20,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 473 [2022-12-06 01:57:20,262 INFO L495 AbstractCegarLoop]: Abstraction has has 638 places, 3981 transitions, 431148 flow [2022-12-06 01:57:20,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:57:20,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:57:20,262 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:57:20,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-06 01:57:20,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:57:20,463 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:57:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:57:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1542405937, now seen corresponding path program 32 times [2022-12-06 01:57:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:57:20,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655159760] [2022-12-06 01:57:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:57:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:57:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:57:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:57:21,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:57:21,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655159760] [2022-12-06 01:57:21,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655159760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:57:21,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932211077] [2022-12-06 01:57:21,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:57:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:57:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:57:21,411 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:57:21,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 01:57:21,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:57:21,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:57:21,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 01:57:21,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:57:22,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:57:22,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 81 [2022-12-06 01:57:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:57:22,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:57:22,697 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 01:57:22,698 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 40 treesize of output 60 [2022-12-06 01:57:22,734 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:57:22,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 01:57:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:57:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932211077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:57:22,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:57:22,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 01:57:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797394668] [2022-12-06 01:57:22,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:57:22,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 01:57:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:57:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 01:57:22,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-06 01:57:22,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:57:22,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 3981 transitions, 431148 flow. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:57:22,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:57:22,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:57:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:57:44,350 INFO L130 PetriNetUnfolder]: 4035/7657 cut-off events. [2022-12-06 01:57:44,350 INFO L131 PetriNetUnfolder]: For 698/698 co-relation queries the response was YES. [2022-12-06 01:57:44,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421720 conditions, 7657 events. 4035/7657 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 62833 event pairs, 14 based on Foata normal form. 0/6137 useless extension candidates. Maximal degree in co-relation 178473. Up to 7658 conditions per place. [2022-12-06 01:57:44,450 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 2428 selfloop transitions, 881 changer transitions 656/3965 dead transitions. [2022-12-06 01:57:44,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 3965 transitions, 437338 flow [2022-12-06 01:57:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:57:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:57:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-12-06 01:57:44,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 01:57:44,451 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 625 predicate places. [2022-12-06 01:57:44,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:57:44,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 648 places, 3965 transitions, 437338 flow [2022-12-06 01:57:44,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 648 places, 3965 transitions, 437338 flow [2022-12-06 01:57:44,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:57:44,809 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:57:44,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-06 01:57:44,810 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 3965 transitions, 437338 flow [2022-12-06 01:57:44,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 01:57:44,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:57:44,810 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:57:44,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-06 01:57:45,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-06 01:57:45,011 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:57:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:57:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2016797083, now seen corresponding path program 33 times [2022-12-06 01:57:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:57:45,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583917336] [2022-12-06 01:57:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:57:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:57:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:57:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:57:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:57:45,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583917336] [2022-12-06 01:57:45,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583917336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:57:45,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640379572] [2022-12-06 01:57:45,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:57:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:57:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:57:45,534 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:57:45,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-06 01:57:45,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 01:57:45,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:57:45,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:57:45,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:57:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:57:46,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:57:46,245 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:57:46,245 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 70 treesize of output 72 [2022-12-06 01:57:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:57:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640379572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:57:46,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:57:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-06 01:57:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863765967] [2022-12-06 01:57:46,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:57:46,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 01:57:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:57:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 01:57:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-06 01:57:46,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:57:46,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 3965 transitions, 437338 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 01:57:46,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:57:46,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:57:46,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:07,039 INFO L130 PetriNetUnfolder]: 4271/8077 cut-off events. [2022-12-06 01:58:07,039 INFO L131 PetriNetUnfolder]: For 726/726 co-relation queries the response was YES. [2022-12-06 01:58:07,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452898 conditions, 8077 events. 4271/8077 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 66832 event pairs, 11 based on Foata normal form. 0/6473 useless extension candidates. Maximal degree in co-relation 193477. Up to 8078 conditions per place. [2022-12-06 01:58:07,260 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 2046 selfloop transitions, 1467 changer transitions 656/4169 dead transitions. [2022-12-06 01:58:07,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 4169 transitions, 468116 flow [2022-12-06 01:58:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 01:58:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 01:58:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 95 transitions. [2022-12-06 01:58:07,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-06 01:58:07,261 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 643 predicate places. [2022-12-06 01:58:07,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:07,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 666 places, 4169 transitions, 468116 flow [2022-12-06 01:58:07,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 666 places, 4169 transitions, 468116 flow [2022-12-06 01:58:07,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:07,543 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:07,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-06 01:58:07,544 INFO L495 AbstractCegarLoop]: Abstraction has has 666 places, 4169 transitions, 468116 flow [2022-12-06 01:58:07,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 01:58:07,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:07,544 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:07,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-06 01:58:07,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-06 01:58:07,751 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:58:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 212176338, now seen corresponding path program 1 times [2022-12-06 01:58:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:07,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672136601] [2022-12-06 01:58:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:07,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:58:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:08,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672136601] [2022-12-06 01:58:08,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672136601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:58:08,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726603612] [2022-12-06 01:58:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:08,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:58:08,195 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:58:08,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-06 01:58:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:08,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 01:58:08,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:58:08,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:58:08,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-06 01:58:08,690 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:58:08,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 01:58:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:58:08,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:58:08,911 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 01:58:08,911 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 114 treesize of output 131 [2022-12-06 01:58:08,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:58:08,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-06 01:58:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:58:09,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726603612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:58:09,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:58:09,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-06 01:58:09,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078432370] [2022-12-06 01:58:09,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:58:09,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 01:58:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 01:58:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=488, Unknown=4, NotChecked=0, Total=600 [2022-12-06 01:58:09,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:58:09,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 4169 transitions, 468116 flow. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:58:09,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:09,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:58:09,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:33,138 INFO L130 PetriNetUnfolder]: 4827/9065 cut-off events. [2022-12-06 01:58:33,138 INFO L131 PetriNetUnfolder]: For 793/793 co-relation queries the response was YES. [2022-12-06 01:58:33,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517358 conditions, 9065 events. 4827/9065 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 75689 event pairs, 11 based on Foata normal form. 0/7315 useless extension candidates. Maximal degree in co-relation 220024. Up to 9066 conditions per place. [2022-12-06 01:58:33,394 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 2924 selfloop transitions, 1061 changer transitions 668/4653 dead transitions. [2022-12-06 01:58:33,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 4653 transitions, 531774 flow [2022-12-06 01:58:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 01:58:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 01:58:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 119 transitions. [2022-12-06 01:58:33,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2022-12-06 01:58:33,395 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 660 predicate places. [2022-12-06 01:58:33,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:33,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 683 places, 4653 transitions, 531774 flow [2022-12-06 01:58:33,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 683 places, 4653 transitions, 531774 flow [2022-12-06 01:58:33,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:33,711 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:33,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-06 01:58:33,712 INFO L495 AbstractCegarLoop]: Abstraction has has 683 places, 4653 transitions, 531774 flow [2022-12-06 01:58:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:58:33,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:33,712 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:33,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-06 01:58:33,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-06 01:58:33,913 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:58:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash -759131415, now seen corresponding path program 34 times [2022-12-06 01:58:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527012485] [2022-12-06 01:58:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:58:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:34,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527012485] [2022-12-06 01:58:34,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527012485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:58:34,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671226659] [2022-12-06 01:58:34,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:58:34,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:58:34,348 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:58:34,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-06 01:58:34,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:58:34,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:58:34,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:58:34,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:58:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:58:34,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:58:34,862 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 01:58:34,862 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 82 treesize of output 107 [2022-12-06 01:58:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:58:34,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671226659] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:58:34,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:58:34,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-06 01:58:34,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095678950] [2022-12-06 01:58:34,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:58:34,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 01:58:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 01:58:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-12-06 01:58:34,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:58:34,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 4653 transitions, 531774 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:58:34,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:34,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:58:34,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:07,483 INFO L130 PetriNetUnfolder]: 4963/9297 cut-off events. [2022-12-06 01:59:07,483 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2022-12-06 01:59:07,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539880 conditions, 9297 events. 4963/9297 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 77796 event pairs, 12 based on Foata normal form. 0/7499 useless extension candidates. Maximal degree in co-relation 230611. Up to 9298 conditions per place. [2022-12-06 01:59:07,621 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 2686 selfloop transitions, 1403 changer transitions 668/4757 dead transitions. [2022-12-06 01:59:07,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 4757 transitions, 553144 flow [2022-12-06 01:59:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:59:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:59:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2022-12-06 01:59:07,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2253968253968254 [2022-12-06 01:59:07,622 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 674 predicate places. [2022-12-06 01:59:07,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:07,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 697 places, 4757 transitions, 553144 flow [2022-12-06 01:59:08,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 697 places, 4757 transitions, 553144 flow [2022-12-06 01:59:08,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:08,103 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:08,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 482 [2022-12-06 01:59:08,104 INFO L495 AbstractCegarLoop]: Abstraction has has 697 places, 4757 transitions, 553144 flow [2022-12-06 01:59:08,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:59:08,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:08,104 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:08,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-06 01:59:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-06 01:59:08,305 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:59:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1582553669, now seen corresponding path program 35 times [2022-12-06 01:59:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676380524] [2022-12-06 01:59:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:59:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:08,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676380524] [2022-12-06 01:59:08,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676380524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:59:08,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993655188] [2022-12-06 01:59:08,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 01:59:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:59:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:59:08,871 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:59:08,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-06 01:59:09,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:59:09,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:59:09,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:59:09,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:59:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:59:09,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:59:09,403 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 01:59:09,404 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 70 treesize of output 72 [2022-12-06 01:59:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:59:09,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993655188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:59:09,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:59:09,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-12-06 01:59:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313353717] [2022-12-06 01:59:09,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:59:09,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 01:59:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 01:59:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-06 01:59:09,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:59:09,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 4757 transitions, 553144 flow. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:59:09,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:09,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:59:09,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:41,905 INFO L130 PetriNetUnfolder]: 5265/9819 cut-off events. [2022-12-06 01:59:41,906 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2022-12-06 01:59:41,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579976 conditions, 9819 events. 5265/9819 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 82660 event pairs, 15 based on Foata normal form. 0/7915 useless extension candidates. Maximal degree in co-relation 249985. Up to 9820 conditions per place. [2022-12-06 01:59:42,054 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 2562 selfloop transitions, 1765 changer transitions 668/4995 dead transitions. [2022-12-06 01:59:42,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 4995 transitions, 590742 flow [2022-12-06 01:59:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 01:59:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 01:59:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2022-12-06 01:59:42,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26278659611992944 [2022-12-06 01:59:42,056 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 700 predicate places. [2022-12-06 01:59:42,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:42,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 723 places, 4995 transitions, 590742 flow [2022-12-06 01:59:42,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 723 places, 4995 transitions, 590742 flow [2022-12-06 01:59:42,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:42,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:42,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 406 [2022-12-06 01:59:42,462 INFO L495 AbstractCegarLoop]: Abstraction has has 723 places, 4995 transitions, 590742 flow [2022-12-06 01:59:42,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:59:42,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:42,462 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:42,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-06 01:59:42,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-06 01:59:42,663 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 01:59:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2068937545, now seen corresponding path program 36 times [2022-12-06 01:59:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:42,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138205608] [2022-12-06 01:59:42,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:59:43,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138205608] [2022-12-06 01:59:43,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138205608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:59:43,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015148180] [2022-12-06 01:59:43,244 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 01:59:43,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:59:43,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:59:43,245 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:59:43,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-06 01:59:43,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 01:59:43,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:59:43,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 01:59:43,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:59:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:59:43,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:59:43,808 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 01:59:43,808 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 82 treesize of output 107 [2022-12-06 01:59:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:59:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015148180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:59:43,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:59:43,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-06 01:59:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556853010] [2022-12-06 01:59:43,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:59:43,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 01:59:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 01:59:43,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-06 01:59:43,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:59:43,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 4995 transitions, 590742 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 01:59:43,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:43,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:59:43,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:00:22,220 INFO L130 PetriNetUnfolder]: 5353/9975 cut-off events. [2022-12-06 02:00:22,220 INFO L131 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2022-12-06 02:00:22,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599156 conditions, 9975 events. 5353/9975 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 84235 event pairs, 10 based on Foata normal form. 0/8039 useless extension candidates. Maximal degree in co-relation 258901. Up to 9976 conditions per place. [2022-12-06 02:00:22,410 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 2910 selfloop transitions, 1497 changer transitions 668/5075 dead transitions. [2022-12-06 02:00:22,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 5075 transitions, 610332 flow [2022-12-06 02:00:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:00:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:00:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 79 transitions. [2022-12-06 02:00:22,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22128851540616246 [2022-12-06 02:00:22,411 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 716 predicate places. [2022-12-06 02:00:22,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:00:22,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 739 places, 5075 transitions, 610332 flow [2022-12-06 02:00:22,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 739 places, 5075 transitions, 610332 flow [2022-12-06 02:00:22,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:00:23,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:00:23,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-06 02:00:23,035 INFO L495 AbstractCegarLoop]: Abstraction has has 739 places, 5075 transitions, 610332 flow [2022-12-06 02:00:23,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:00:23,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:00:23,036 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:00:23,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-06 02:00:23,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-06 02:00:23,236 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:00:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:00:23,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1552912899, now seen corresponding path program 37 times [2022-12-06 02:00:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:00:23,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407310941] [2022-12-06 02:00:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:00:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:00:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:00:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:00:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:00:23,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407310941] [2022-12-06 02:00:23,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407310941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:00:23,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332684195] [2022-12-06 02:00:23,812 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:00:23,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:00:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:00:23,814 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:00:23,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-06 02:00:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:00:24,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:00:24,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:00:24,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:00:24,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:00:24,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:00:24,350 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-06 02:00:24,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 35 [2022-12-06 02:00:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:00:24,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:00:24,527 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3992 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3992))) (let ((.cse1 (select .cse0 ~o_2~0.base))) (or (not (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset))) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_3992 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3992))) (= (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset))))))) is different from false [2022-12-06 02:00:24,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:00:24,559 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 116 treesize of output 148 [2022-12-06 02:00:24,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:00:24,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-06 02:00:24,869 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:00:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:00:24,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332684195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:00:24,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:00:24,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-12-06 02:00:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701803479] [2022-12-06 02:00:24,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:00:24,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:00:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:00:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:00:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=504, Unknown=1, NotChecked=46, Total=650 [2022-12-06 02:00:24,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:00:24,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 5075 transitions, 610332 flow. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:00:24,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:00:24,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:00:24,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:01:10,773 INFO L130 PetriNetUnfolder]: 6217/11769 cut-off events. [2022-12-06 02:01:10,773 INFO L131 PetriNetUnfolder]: For 925/925 co-relation queries the response was YES. [2022-12-06 02:01:10,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718644 conditions, 11769 events. 6217/11769 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 104429 event pairs, 11 based on Foata normal form. 0/9501 useless extension candidates. Maximal degree in co-relation 312381. Up to 11770 conditions per place. [2022-12-06 02:01:10,969 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 3934 selfloop transitions, 1481 changer transitions 842/6257 dead transitions. [2022-12-06 02:01:10,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 6257 transitions, 764890 flow [2022-12-06 02:01:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:01:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:01:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 02:01:10,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 02:01:10,970 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 727 predicate places. [2022-12-06 02:01:10,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:01:10,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 750 places, 6257 transitions, 764890 flow [2022-12-06 02:01:11,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 750 places, 6257 transitions, 764890 flow [2022-12-06 02:01:11,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:01:11,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:01:11,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 709 [2022-12-06 02:01:11,679 INFO L495 AbstractCegarLoop]: Abstraction has has 750 places, 6257 transitions, 764890 flow [2022-12-06 02:01:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:01:11,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:01:11,679 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:01:11,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-06 02:01:11,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:01:11,880 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:01:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:01:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 835625571, now seen corresponding path program 38 times [2022-12-06 02:01:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:01:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256704144] [2022-12-06 02:01:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:01:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:01:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:01:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:01:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:01:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256704144] [2022-12-06 02:01:12,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256704144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:01:12,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255792456] [2022-12-06 02:01:12,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:01:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:01:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:01:12,659 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:01:12,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-06 02:01:13,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:01:13,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:01:13,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 02:01:13,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:01:13,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 02:01:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:01:13,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-12-06 02:01:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:01:13,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:01:13,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:01:13,640 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 94 treesize of output 134 [2022-12-06 02:01:13,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:01:13,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-06 02:01:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:01:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255792456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:01:13,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:01:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-12-06 02:01:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055048795] [2022-12-06 02:01:13,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:01:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 02:01:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:01:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 02:01:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=699, Unknown=1, NotChecked=0, Total=812 [2022-12-06 02:01:13,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:01:13,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 6257 transitions, 764890 flow. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:01:13,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:01:13,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:01:13,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:02:12,542 INFO L130 PetriNetUnfolder]: 6227/11805 cut-off events. [2022-12-06 02:02:12,543 INFO L131 PetriNetUnfolder]: For 916/916 co-relation queries the response was YES. [2022-12-06 02:02:12,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732654 conditions, 11805 events. 6227/11805 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 104995 event pairs, 16 based on Foata normal form. 0/9537 useless extension candidates. Maximal degree in co-relation 317935. Up to 11806 conditions per place. [2022-12-06 02:02:12,726 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 4042 selfloop transitions, 1357 changer transitions 876/6275 dead transitions. [2022-12-06 02:02:12,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 6275 transitions, 779654 flow [2022-12-06 02:02:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:02:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:02:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-12-06 02:02:12,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2022-12-06 02:02:12,728 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 736 predicate places. [2022-12-06 02:02:12,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:02:12,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 759 places, 6275 transitions, 779654 flow [2022-12-06 02:02:13,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 759 places, 6275 transitions, 779654 flow [2022-12-06 02:02:13,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:02:13,390 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:02:13,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 662 [2022-12-06 02:02:13,390 INFO L495 AbstractCegarLoop]: Abstraction has has 759 places, 6275 transitions, 779654 flow [2022-12-06 02:02:13,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:02:13,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:02:13,391 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:02:13,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-12-06 02:02:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:02:13,595 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:02:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:02:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 549898747, now seen corresponding path program 39 times [2022-12-06 02:02:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:02:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664128840] [2022-12-06 02:02:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:02:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:02:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:02:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:02:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:02:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664128840] [2022-12-06 02:02:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664128840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:02:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692982462] [2022-12-06 02:02:14,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:02:14,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:02:14,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:02:14,058 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:02:14,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-06 02:02:14,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:02:14,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:02:14,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 02:02:14,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:02:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:02:14,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:02:14,849 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 02:02:14,850 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 70 treesize of output 72 [2022-12-06 02:02:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:02:14,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692982462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:02:14,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:02:14,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 02:02:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201445230] [2022-12-06 02:02:14,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:02:14,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:02:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:02:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:02:14,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:02:14,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:02:14,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 6275 transitions, 779654 flow. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:02:14,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:02:14,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:02:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:03:17,582 INFO L130 PetriNetUnfolder]: 6357/12067 cut-off events. [2022-12-06 02:03:17,583 INFO L131 PetriNetUnfolder]: For 925/925 co-relation queries the response was YES. [2022-12-06 02:03:17,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760966 conditions, 12067 events. 6357/12067 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 107867 event pairs, 12 based on Foata normal form. 0/9749 useless extension candidates. Maximal degree in co-relation 331315. Up to 12068 conditions per place. [2022-12-06 02:03:17,771 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 3258 selfloop transitions, 2307 changer transitions 876/6441 dead transitions. [2022-12-06 02:03:17,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 6441 transitions, 813120 flow [2022-12-06 02:03:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:03:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:03:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 87 transitions. [2022-12-06 02:03:17,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24369747899159663 [2022-12-06 02:03:17,773 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 752 predicate places. [2022-12-06 02:03:17,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:03:17,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 775 places, 6441 transitions, 813120 flow [2022-12-06 02:03:18,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 775 places, 6441 transitions, 813120 flow [2022-12-06 02:03:18,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:03:18,395 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:03:18,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 623 [2022-12-06 02:03:18,396 INFO L495 AbstractCegarLoop]: Abstraction has has 775 places, 6441 transitions, 813120 flow [2022-12-06 02:03:18,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:03:18,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:03:18,396 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:03:18,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-06 02:03:18,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:03:18,597 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:03:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:03:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2144211835, now seen corresponding path program 40 times [2022-12-06 02:03:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:03:18,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694928623] [2022-12-06 02:03:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:03:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:03:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:03:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:03:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:03:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694928623] [2022-12-06 02:03:19,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694928623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:03:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856877846] [2022-12-06 02:03:19,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:03:19,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:03:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:03:19,075 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:03:19,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-06 02:03:19,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:03:19,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:03:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 02:03:19,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:03:19,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:03:19,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-06 02:03:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:03:19,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:03:19,846 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 02:03:19,847 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 70 treesize of output 72 [2022-12-06 02:03:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:03:19,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856877846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:03:19,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:03:19,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-06 02:03:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944217863] [2022-12-06 02:03:19,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:03:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:03:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:03:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:03:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:03:19,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:03:19,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 6441 transitions, 813120 flow. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:03:19,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:03:19,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:03:19,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:03:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:03:37,876 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:03:37,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-06 02:03:37,896 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:03:37,902 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 02:03:38,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-06 02:03:38,077 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (21states, 0/21 universal loopers) in iteration 63,while PetriNetUnfolder was constructing finite prefix that currently has 221115 conditions, 3452 events (1722/3451 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 33155 event pairs, 4 based on Foata normal form. 0/3659 useless extension candidates. Maximal degree in co-relation 139709. Up to 3452 conditions per place.). [2022-12-06 02:03:38,078 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:03:38,079 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:03:38,079 INFO L458 BasicCegarLoop]: Path program histogram: [40, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:03:38,081 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:03:38,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:03:38,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:03:38 BasicIcfg [2022-12-06 02:03:38,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:03:38,083 INFO L158 Benchmark]: Toolchain (without parser) took 791348.50ms. Allocated memory was 204.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 181.4MB in the beginning and 401.4MB in the end (delta: -220.0MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 02:03:38,084 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:03:38,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.13ms. Allocated memory is still 204.5MB. Free memory was 180.9MB in the beginning and 169.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 02:03:38,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.64ms. Allocated memory is still 204.5MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:03:38,084 INFO L158 Benchmark]: Boogie Preprocessor took 38.86ms. Allocated memory is still 204.5MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:03:38,084 INFO L158 Benchmark]: RCFGBuilder took 519.51ms. Allocated memory is still 204.5MB. Free memory was 165.1MB in the beginning and 145.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 02:03:38,084 INFO L158 Benchmark]: TraceAbstraction took 790411.03ms. Allocated memory was 204.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 145.2MB in the beginning and 401.4MB in the end (delta: -256.2MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 02:03:38,085 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.13ms. Allocated memory is still 204.5MB. Free memory was 180.9MB in the beginning and 169.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.64ms. Allocated memory is still 204.5MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.86ms. Allocated memory is still 204.5MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 519.51ms. Allocated memory is still 204.5MB. Free memory was 165.1MB in the beginning and 145.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 790411.03ms. Allocated memory was 204.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 145.2MB in the beginning and 401.4MB in the end (delta: -256.2MB). 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: 6.2s, 203 PlacesBefore, 23 PlacesAfterwards, 217 TransitionsBefore, 20 TransitionsAfterwards, 5400 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 98 TrivialYvCompositions, 82 ConcurrentYvCompositions, 17 ChoiceCompositions, 197 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 3467, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3479, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3116, unknown conditional: 0, unknown unconditional: 3116] , Statistics on independence cache: Total cache size (in pairs): 6784, Positive cache size: 6775, Positive conditional cache size: 0, Positive unconditional cache size: 6775, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 25 PlacesBefore, 25 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 67 PlacesBefore, 63 PlacesAfterwards, 179 TransitionsBefore, 177 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 76 PlacesBefore, 72 PlacesAfterwards, 208 TransitionsBefore, 206 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 222 TransitionsBefore, 222 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 230 TransitionsBefore, 230 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 111 PlacesBefore, 111 PlacesAfterwards, 320 TransitionsBefore, 320 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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: 1.2s, 123 PlacesBefore, 117 PlacesAfterwards, 349 TransitionsBefore, 347 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 138 PlacesBefore, 135 PlacesAfterwards, 621 TransitionsBefore, 619 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 149 PlacesBefore, 146 PlacesAfterwards, 690 TransitionsBefore, 688 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.8s, 157 PlacesBefore, 156 PlacesAfterwards, 697 TransitionsBefore, 696 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 717 TransitionsBefore, 717 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 175 PlacesBefore, 175 PlacesAfterwards, 732 TransitionsBefore, 732 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 187 PlacesBefore, 187 PlacesAfterwards, 824 TransitionsBefore, 824 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 197 PlacesBefore, 197 PlacesAfterwards, 980 TransitionsBefore, 980 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 210 PlacesBefore, 210 PlacesAfterwards, 1146 TransitionsBefore, 1146 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 220 PlacesBefore, 220 PlacesAfterwards, 1189 TransitionsBefore, 1189 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 230 PlacesBefore, 230 PlacesAfterwards, 1215 TransitionsBefore, 1215 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 257 PlacesBefore, 257 PlacesAfterwards, 1413 TransitionsBefore, 1413 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 267 PlacesBefore, 267 PlacesAfterwards, 1423 TransitionsBefore, 1423 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 277 PlacesBefore, 277 PlacesAfterwards, 1434 TransitionsBefore, 1434 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 288 PlacesBefore, 288 PlacesAfterwards, 1432 TransitionsBefore, 1432 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 299 PlacesBefore, 299 PlacesAfterwards, 1434 TransitionsBefore, 1434 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 310 PlacesBefore, 310 PlacesAfterwards, 1449 TransitionsBefore, 1449 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 322 PlacesBefore, 322 PlacesAfterwards, 1503 TransitionsBefore, 1503 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 333 PlacesBefore, 333 PlacesAfterwards, 1502 TransitionsBefore, 1502 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 344 PlacesBefore, 344 PlacesAfterwards, 1523 TransitionsBefore, 1523 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 357 PlacesBefore, 357 PlacesAfterwards, 1515 TransitionsBefore, 1515 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 366 PlacesBefore, 366 PlacesAfterwards, 1534 TransitionsBefore, 1534 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 378 PlacesBefore, 378 PlacesAfterwards, 1543 TransitionsBefore, 1543 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 392 PlacesBefore, 392 PlacesAfterwards, 1579 TransitionsBefore, 1579 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 413 PlacesBefore, 413 PlacesAfterwards, 1564 TransitionsBefore, 1564 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 437 PlacesBefore, 437 PlacesAfterwards, 3209 TransitionsBefore, 3209 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 452 PlacesBefore, 452 PlacesAfterwards, 3251 TransitionsBefore, 3251 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 479 PlacesBefore, 479 PlacesAfterwards, 3589 TransitionsBefore, 3589 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 490 PlacesBefore, 490 PlacesAfterwards, 3519 TransitionsBefore, 3519 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 499 PlacesBefore, 499 PlacesAfterwards, 3549 TransitionsBefore, 3549 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 509 PlacesBefore, 509 PlacesAfterwards, 3547 TransitionsBefore, 3547 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 526 PlacesBefore, 526 PlacesAfterwards, 3655 TransitionsBefore, 3655 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 539 PlacesBefore, 539 PlacesAfterwards, 3759 TransitionsBefore, 3759 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 559 PlacesBefore, 559 PlacesAfterwards, 3793 TransitionsBefore, 3793 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 569 PlacesBefore, 569 PlacesAfterwards, 3789 TransitionsBefore, 3789 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 603 PlacesBefore, 603 PlacesAfterwards, 3859 TransitionsBefore, 3859 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 616 PlacesBefore, 616 PlacesAfterwards, 3915 TransitionsBefore, 3915 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 629 PlacesBefore, 629 PlacesAfterwards, 3965 TransitionsBefore, 3965 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 638 PlacesBefore, 638 PlacesAfterwards, 3981 TransitionsBefore, 3981 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 648 PlacesBefore, 648 PlacesAfterwards, 3965 TransitionsBefore, 3965 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 666 PlacesBefore, 666 PlacesAfterwards, 4169 TransitionsBefore, 4169 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 683 PlacesBefore, 683 PlacesAfterwards, 4653 TransitionsBefore, 4653 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 697 PlacesBefore, 697 PlacesAfterwards, 4757 TransitionsBefore, 4757 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 723 PlacesBefore, 723 PlacesAfterwards, 4995 TransitionsBefore, 4995 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 739 PlacesBefore, 739 PlacesAfterwards, 5075 TransitionsBefore, 5075 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 750 PlacesBefore, 750 PlacesAfterwards, 6257 TransitionsBefore, 6257 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 759 PlacesBefore, 759 PlacesAfterwards, 6275 TransitionsBefore, 6275 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 775 PlacesBefore, 775 PlacesAfterwards, 6441 TransitionsBefore, 6441 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (21states, 0/21 universal loopers) in iteration 63,while PetriNetUnfolder was constructing finite prefix that currently has 221115 conditions, 3452 events (1722/3451 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 33155 event pairs, 4 based on Foata normal form. 0/3659 useless extension candidates. Maximal degree in co-relation 139709. Up to 3452 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 (21states, 0/21 universal loopers) in iteration 63,while PetriNetUnfolder was constructing finite prefix that currently has 221115 conditions, 3452 events (1722/3451 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 33155 event pairs, 4 based on Foata normal form. 0/3659 useless extension candidates. Maximal degree in co-relation 139709. Up to 3452 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 (21states, 0/21 universal loopers) in iteration 63,while PetriNetUnfolder was constructing finite prefix that currently has 221115 conditions, 3452 events (1722/3451 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 33155 event pairs, 4 based on Foata normal form. 0/3659 useless extension candidates. Maximal degree in co-relation 139709. Up to 3452 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 291 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 790.3s, OverallIterations: 63, TraceHistogramMax: 5, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.0s, AutomataDifference: 661.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 162 mSolverCounterUnknown, 8336 SdHoareTripleChecker+Valid, 28.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8336 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 26.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 536 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29131 IncrementalHoareTripleChecker+Invalid, 30736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 907 mSolverCounterUnsat, 0 mSDtfsCounter, 29131 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3573 GetRequests, 1625 SyntacticMatches, 98 SemanticMatches, 1850 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 12800 ImplicationChecksByTransitivity, 57.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813120occurred in iteration=62, InterpolantAutomatonStates: 848, 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.9s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 75.6s InterpolantComputationTime, 2295 NumberOfCodeBlocks, 2279 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 3160 ConstructedInterpolants, 92 QuantifiedInterpolants, 53240 SizeOfPredicates, 1369 NumberOfNonLiveVariables, 18035 ConjunctsInSsa, 2763 ConjunctsInUnsatCore, 177 InterpolantComputations, 7 PerfectInterpolantSequences, 628/1103 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