/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:40:25,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:40:25,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:40:25,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:40:25,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:40:25,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:40:25,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:40:25,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:40:25,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:40:25,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:40:25,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:40:25,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:40:25,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:40:25,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:40:25,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:40:25,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:40:25,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:40:25,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:40:25,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:40:25,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:40:25,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:40:25,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:40:25,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:40:25,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:40:25,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:40:25,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:40:25,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:40:25,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:40:25,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:40:25,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:40:25,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:40:25,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:40:25,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:40:25,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:40:25,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:40:25,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:40:25,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:40:25,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:40:25,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:40:25,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:40:25,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:40:25,132 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-13 08:40:25,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:40:25,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:40:25,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:40:25,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:40:25,163 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:40:25,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:40:25,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:40:25,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:40:25,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:40:25,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:40:25,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:40:25,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:40:25,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:40:25,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:40:25,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:40:25,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:40:25,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:40:25,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:40:25,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:40:25,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:40:25,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:40:25,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:40:25,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:40:25,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:40:25,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:40:25,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:40:25,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:40:25,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:40:25,167 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 08:40:25,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:40:25,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:40:25,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:40:25,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:40:25,493 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:40:25,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 08:40:26,636 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:40:26,804 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:40:26,805 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 08:40:26,810 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed356abb/3975d9a376e3433dbdc0f40b780d3394/FLAG038fee2d8 [2022-12-13 08:40:26,820 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed356abb/3975d9a376e3433dbdc0f40b780d3394 [2022-12-13 08:40:26,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:40:26,823 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:40:26,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:40:26,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:40:26,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:40:26,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:40:26" (1/1) ... [2022-12-13 08:40:26,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b39c93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:26, skipping insertion in model container [2022-12-13 08:40:26,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:40:26" (1/1) ... [2022-12-13 08:40:26,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:40:26,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:40:27,009 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-13 08:40:27,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:40:27,029 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:40:27,068 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-13 08:40:27,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:40:27,086 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:40:27,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27 WrapperNode [2022-12-13 08:40:27,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:40:27,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:40:27,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:40:27,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:40:27,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,145 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-13 08:40:27,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:40:27,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:40:27,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:40:27,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:40:27,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:40:27,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:40:27,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:40:27,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:40:27,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (1/1) ... [2022-12-13 08:40:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:40:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:27,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 08:40:27,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 08:40:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:40:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:40:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:40:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:40:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:40:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:40:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:40:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:40:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 08:40:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:40:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:40:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:40:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:40:27,265 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 08:40:27,375 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:40:27,376 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:40:27,671 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:40:27,679 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:40:27,679 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 08:40:27,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:40:27 BoogieIcfgContainer [2022-12-13 08:40:27,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:40:27,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:40:27,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:40:27,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:40:27,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:40:26" (1/3) ... [2022-12-13 08:40:27,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271237a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:40:27, skipping insertion in model container [2022-12-13 08:40:27,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:27" (2/3) ... [2022-12-13 08:40:27,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271237a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:40:27, skipping insertion in model container [2022-12-13 08:40:27,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:40:27" (3/3) ... [2022-12-13 08:40:27,699 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-13 08:40:27,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:40:27,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:40:27,715 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:40:27,782 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 08:40:27,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 08:40:27,907 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-13 08:40:27,908 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:40:27,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 08:40:27,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 08:40:27,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-13 08:40:27,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:27,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 08:40:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-13 08:40:27,997 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-13 08:40:27,998 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:40:28,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 08:40:28,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 08:40:28,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-13 08:40:32,135 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 08:40:32,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:40:32,154 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;@1cb5fb46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:40:32,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 08:40:32,158 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 08:40:32,159 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:40:32,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:32,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:32,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-13 08:40:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:32,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039552192] [2022-12-13 08:40:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:32,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:32,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039552192] [2022-12-13 08:40:32,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039552192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:40:32,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:40:32,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:40:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734346170] [2022-12-13 08:40:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:32,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:40:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:40:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:40:32,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 08:40:32,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:32,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:32,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 08:40:32,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:32,616 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 08:40:32,616 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 08:40:32,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-13 08:40:32,618 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 08:40:32,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 08:40:32,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:40:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:40:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 08:40:32,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 08:40:32,630 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 08:40:32,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 08:40:32,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 80 flow [2022-12-13 08:40:32,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:32,633 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 08:40:32,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:32,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:32,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 08:40:32,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 08:40:32,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 08:40:33,571 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:40:33,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 941 [2022-12-13 08:40:33,573 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 76 flow [2022-12-13 08:40:33,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:33,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:33,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:33,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:40:33,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:33,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-13 08:40:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:33,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887169695] [2022-12-13 08:40:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:33,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:33,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887169695] [2022-12-13 08:40:33,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887169695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:40:33,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:40:33,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:40:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855361548] [2022-12-13 08:40:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:33,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:40:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:40:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:40:33,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 08:40:33,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:33,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:33,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 08:40:33,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:33,883 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 08:40:33,883 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-12-13 08:40:33,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 116 events. 66/116 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2022-12-13 08:40:33,885 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 08:40:33,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 175 flow [2022-12-13 08:40:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:40:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:40:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 08:40:33,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 08:40:33,886 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 08:40:33,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 27 transitions, 175 flow [2022-12-13 08:40:33,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 26 transitions, 166 flow [2022-12-13 08:40:33,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:33,888 INFO L89 Accepts]: Start accepts. Operand has 24 places, 26 transitions, 166 flow [2022-12-13 08:40:33,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:33,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:33,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 26 transitions, 166 flow [2022-12-13 08:40:33,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 26 transitions, 166 flow [2022-12-13 08:40:33,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 08:40:33,891 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:33,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:40:33,892 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 26 transitions, 166 flow [2022-12-13 08:40:33,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:33,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:33,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:33,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:40:33,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash -807143668, now seen corresponding path program 1 times [2022-12-13 08:40:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:33,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606361011] [2022-12-13 08:40:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:33,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606361011] [2022-12-13 08:40:33,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606361011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:40:33,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:40:33,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:40:33,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759019253] [2022-12-13 08:40:33,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:33,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:40:33,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:33,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:40:33,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:40:33,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:40:33,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 08:40:33,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:33,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:40:33,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:34,130 INFO L130 PetriNetUnfolder]: 87/167 cut-off events. [2022-12-13 08:40:34,131 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-13 08:40:34,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 167 events. 87/167 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 513 event pairs, 10 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 466. Up to 142 conditions per place. [2022-12-13 08:40:34,132 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 40 selfloop transitions, 4 changer transitions 10/54 dead transitions. [2022-12-13 08:40:34,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 54 transitions, 452 flow [2022-12-13 08:40:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:40:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:40:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 08:40:34,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4470588235294118 [2022-12-13 08:40:34,134 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-13 08:40:34,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 54 transitions, 452 flow [2022-12-13 08:40:34,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 44 transitions, 370 flow [2022-12-13 08:40:34,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:34,137 INFO L89 Accepts]: Start accepts. Operand has 27 places, 44 transitions, 370 flow [2022-12-13 08:40:34,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:34,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:34,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 44 transitions, 370 flow [2022-12-13 08:40:34,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 44 transitions, 370 flow [2022-12-13 08:40:34,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:34,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:34,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 08:40:34,141 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 44 transitions, 370 flow [2022-12-13 08:40:34,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 08:40:34,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:34,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:34,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:40:34,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash -92123380, now seen corresponding path program 2 times [2022-12-13 08:40:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:34,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562335684] [2022-12-13 08:40:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:34,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562335684] [2022-12-13 08:40:34,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562335684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:34,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958218846] [2022-12-13 08:40:34,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:40:34,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:34,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:34,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 08:40:34,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:34,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:34,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:40:34,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:34,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 08:40:34,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958218846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:40:34,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 08:40:34,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 08:40:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500345716] [2022-12-13 08:40:34,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:40:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:40:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:40:34,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:40:34,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 44 transitions, 370 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-13 08:40:34,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:34,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:40:34,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:34,540 INFO L130 PetriNetUnfolder]: 86/158 cut-off events. [2022-12-13 08:40:34,540 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 08:40:34,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 158 events. 86/158 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 442 event pairs, 10 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 550. Up to 135 conditions per place. [2022-12-13 08:40:34,542 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2022-12-13 08:40:34,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:40:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:40:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 08:40:34,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-13 08:40:34,557 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-13 08:40:34,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:34,560 INFO L89 Accepts]: Start accepts. Operand has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:34,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:34,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:34,562 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:34,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 08:40:34,564 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 51 transitions, 523 flow [2022-12-13 08:40:34,564 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-13 08:40:34,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:34,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:34,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:34,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:34,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1950024266, now seen corresponding path program 1 times [2022-12-13 08:40:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:34,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244135385] [2022-12-13 08:40:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:34,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244135385] [2022-12-13 08:40:34,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244135385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:40:34,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:40:34,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:40:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107834135] [2022-12-13 08:40:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:34,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:40:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:34,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:40:34,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:40:34,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:40:34,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 51 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 08:40:34,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:34,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:40:34,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:35,023 INFO L130 PetriNetUnfolder]: 93/183 cut-off events. [2022-12-13 08:40:35,023 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-13 08:40:35,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 183 events. 93/183 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 582 event pairs, 8 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 877. Up to 160 conditions per place. [2022-12-13 08:40:35,025 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 56 selfloop transitions, 6 changer transitions 14/76 dead transitions. [2022-12-13 08:40:35,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 76 transitions, 932 flow [2022-12-13 08:40:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:40:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:40:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 08:40:35,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-13 08:40:35,027 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-13 08:40:35,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 76 transitions, 932 flow [2022-12-13 08:40:35,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 62 transitions, 756 flow [2022-12-13 08:40:35,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:35,030 INFO L89 Accepts]: Start accepts. Operand has 33 places, 62 transitions, 756 flow [2022-12-13 08:40:35,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:35,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:35,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 62 transitions, 756 flow [2022-12-13 08:40:35,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 62 transitions, 756 flow [2022-12-13 08:40:35,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:35,033 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:35,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:40:35,034 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 62 transitions, 756 flow [2022-12-13 08:40:35,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 08:40:35,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:35,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:35,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:40:35,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1166910282, now seen corresponding path program 2 times [2022-12-13 08:40:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276161216] [2022-12-13 08:40:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:35,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276161216] [2022-12-13 08:40:35,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276161216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:35,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653250407] [2022-12-13 08:40:35,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:40:35,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:35,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:35,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 08:40:35,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:35,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:35,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:40:35,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:35,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:35,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653250407] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:35,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 08:40:35,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-13 08:40:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469759259] [2022-12-13 08:40:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:35,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:40:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:40:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:40:35,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:40:35,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 62 transitions, 756 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-13 08:40:35,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:35,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:40:35,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:35,362 INFO L130 PetriNetUnfolder]: 92/172 cut-off events. [2022-12-13 08:40:35,362 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 08:40:35,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 172 events. 92/172 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 489 event pairs, 8 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 976. Up to 153 conditions per place. [2022-12-13 08:40:35,366 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 58 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2022-12-13 08:40:35,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:40:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:40:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 08:40:35,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-13 08:40:35,370 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 08:40:35,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:35,375 INFO L89 Accepts]: Start accepts. Operand has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:35,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:35,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:35,378 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:35,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 08:40:35,384 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 67 transitions, 938 flow [2022-12-13 08:40:35,384 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-13 08:40:35,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:35,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:35,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 08:40:35,591 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,SelfDestructingSolverStorable5 [2022-12-13 08:40:35,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1046367850, now seen corresponding path program 3 times [2022-12-13 08:40:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:35,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231091472] [2022-12-13 08:40:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:35,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:35,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231091472] [2022-12-13 08:40:35,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231091472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:35,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147836908] [2022-12-13 08:40:35,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:40:35,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:35,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:35,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 08:40:35,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:40:35,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:35,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:40:35,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:35,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:35,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147836908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:35,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:35,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-13 08:40:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436985341] [2022-12-13 08:40:35,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:35,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:40:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:40:35,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:40:35,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:40:35,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 67 transitions, 938 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:35,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:35,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:40:35,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:36,070 INFO L130 PetriNetUnfolder]: 111/205 cut-off events. [2022-12-13 08:40:36,070 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-12-13 08:40:36,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 205 events. 111/205 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 618 event pairs, 8 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 1388. Up to 186 conditions per place. [2022-12-13 08:40:36,072 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 65 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2022-12-13 08:40:36,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:40:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:40:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-13 08:40:36,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4369747899159664 [2022-12-13 08:40:36,074 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 08:40:36,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:36,091 INFO L89 Accepts]: Start accepts. Operand has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:36,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:36,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:36,094 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:36,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:40:36,095 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 82 transitions, 1318 flow [2022-12-13 08:40:36,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:36,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:36,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:36,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 08:40:36,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:36,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:36,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1844377062, now seen corresponding path program 3 times [2022-12-13 08:40:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:36,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000553567] [2022-12-13 08:40:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000553567] [2022-12-13 08:40:36,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000553567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:40:36,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:40:36,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:40:36,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361415036] [2022-12-13 08:40:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:40:36,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:40:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:36,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:40:36,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:40:36,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:40:36,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 82 transitions, 1318 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-13 08:40:36,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:36,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:40:36,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:36,476 INFO L130 PetriNetUnfolder]: 111/199 cut-off events. [2022-12-13 08:40:36,476 INFO L131 PetriNetUnfolder]: For 290/290 co-relation queries the response was YES. [2022-12-13 08:40:36,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 199 events. 111/199 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 579 event pairs, 8 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 1519. Up to 180 conditions per place. [2022-12-13 08:40:36,479 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 64 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2022-12-13 08:40:36,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:40:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:40:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 08:40:36,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-13 08:40:36,484 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 08:40:36,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:36,492 INFO L89 Accepts]: Start accepts. Operand has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:36,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:36,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:36,496 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:36,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:40:36,498 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 79 transitions, 1416 flow [2022-12-13 08:40:36,498 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-13 08:40:36,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:36,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 08:40:36,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash 218077724, now seen corresponding path program 4 times [2022-12-13 08:40:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:36,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127497872] [2022-12-13 08:40:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:36,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127497872] [2022-12-13 08:40:36,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127497872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:36,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430621801] [2022-12-13 08:40:36,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:40:36,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:36,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:36,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 08:40:36,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:40:36,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:36,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:40:36,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:36,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:36,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430621801] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:36,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 08:40:36,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056299122] [2022-12-13 08:40:36,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:36,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:40:36,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:40:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:40:36,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:40:36,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 79 transitions, 1416 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:36,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:36,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:40:36,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:36,881 INFO L130 PetriNetUnfolder]: 105/185 cut-off events. [2022-12-13 08:40:36,881 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-13 08:40:36,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 185 events. 105/185 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 528 event pairs, 8 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 1573. Up to 166 conditions per place. [2022-12-13 08:40:36,884 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 58 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2022-12-13 08:40:36,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:40:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:40:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-13 08:40:36,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 08:40:36,885 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-13 08:40:36,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:36,889 INFO L89 Accepts]: Start accepts. Operand has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:36,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:36,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:36,893 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:36,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:40:36,894 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 72 transitions, 1428 flow [2022-12-13 08:40:36,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:36,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:36,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:36,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:37,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:37,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1528703105, now seen corresponding path program 1 times [2022-12-13 08:40:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324350733] [2022-12-13 08:40:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:37,214 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-13 08:40:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:37,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324350733] [2022-12-13 08:40:37,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324350733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:37,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065729031] [2022-12-13 08:40:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:37,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:37,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:37,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 08:40:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:37,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 08:40:37,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:37,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 08:40:37,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:40:37,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:40:37,477 INFO L321 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-12-13 08:40:37,478 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 31 [2022-12-13 08:40:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:37,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:37,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (~x2~0 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (= (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (< .cse0 0))))) is different from false [2022-12-13 08:40:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:37,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065729031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:37,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:37,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-13 08:40:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780950462] [2022-12-13 08:40:37,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:37,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 08:40:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:37,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 08:40:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2022-12-13 08:40:37,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:40:37,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 72 transitions, 1428 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 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-13 08:40:37,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:37,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:40:37,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:38,404 INFO L130 PetriNetUnfolder]: 315/553 cut-off events. [2022-12-13 08:40:38,404 INFO L131 PetriNetUnfolder]: For 1231/1231 co-relation queries the response was YES. [2022-12-13 08:40:38,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5912 conditions, 553 events. 315/553 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2290 event pairs, 10 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 3713. Up to 498 conditions per place. [2022-12-13 08:40:38,408 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 67 selfloop transitions, 23 changer transitions 125/218 dead transitions. [2022-12-13 08:40:38,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 218 transitions, 4826 flow [2022-12-13 08:40:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:40:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 08:40:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-12-13 08:40:38,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088235294117647 [2022-12-13 08:40:38,410 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2022-12-13 08:40:38,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 218 transitions, 4826 flow [2022-12-13 08:40:38,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 93 transitions, 2028 flow [2022-12-13 08:40:38,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:38,419 INFO L89 Accepts]: Start accepts. Operand has 57 places, 93 transitions, 2028 flow [2022-12-13 08:40:38,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:38,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:38,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 93 transitions, 2028 flow [2022-12-13 08:40:38,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 93 transitions, 2028 flow [2022-12-13 08:40:38,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:40,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_71| 1) (= v_~x1~0_76 (select (select |v_#memory_int_125| v_~f~0.base_71) (+ v_~f~0.offset_71 (* v_~x1~0_77 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= (ite (and (< v_~x1~0_77 v_~size~0_84) (<= 0 v_~x1~0_77)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (< 0 (* (mod v_~n~0_78 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0))) InVars {~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_125|, ~n~0=v_~n~0_78, ~x1~0=v_~x1~0_77, ~f~0.offset=v_~f~0.offset_71} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_39|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, #memory_int=|v_#memory_int_125|, ~n~0=v_~n~0_78, ~x1~0=v_~x1~0_76, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_47|, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 08:40:40,846 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 08:40:40,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2428 [2022-12-13 08:40:40,847 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 90 transitions, 1970 flow [2022-12-13 08:40:40,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 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-13 08:40:40,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:40,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:40,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:41,048 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-13 08:40:41,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1770980872, now seen corresponding path program 1 times [2022-12-13 08:40:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:41,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881173477] [2022-12-13 08:40:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881173477] [2022-12-13 08:40:41,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881173477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395392273] [2022-12-13 08:40:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:41,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:41,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:41,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 08:40:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:41,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 08:40:41,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:41,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 08:40:41,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:40:41,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:40:42,022 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-13 08:40:42,023 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-13 08:40:42,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-13 08:40:42,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:42,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset)) (select .cse1 (+ (* .cse0 4) c_~f~0.offset))))))) is different from false [2022-12-13 08:40:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:42,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395392273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:42,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:42,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 08:40:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386502691] [2022-12-13 08:40:42,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 08:40:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 08:40:42,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-12-13 08:40:42,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-13 08:40:42,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 90 transitions, 1970 flow. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 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-13 08:40:42,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:42,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-13 08:40:42,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:42,480 INFO L130 PetriNetUnfolder]: 181/319 cut-off events. [2022-12-13 08:40:42,481 INFO L131 PetriNetUnfolder]: For 994/994 co-relation queries the response was YES. [2022-12-13 08:40:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 319 events. 181/319 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1109 event pairs, 4 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 2219. Up to 290 conditions per place. [2022-12-13 08:40:42,484 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 74 selfloop transitions, 7 changer transitions 39/126 dead transitions. [2022-12-13 08:40:42,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 126 transitions, 3023 flow [2022-12-13 08:40:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:40:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:40:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 08:40:42,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2022-12-13 08:40:42,486 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 38 predicate places. [2022-12-13 08:40:42,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 126 transitions, 3023 flow [2022-12-13 08:40:42,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 87 transitions, 2061 flow [2022-12-13 08:40:42,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:42,496 INFO L89 Accepts]: Start accepts. Operand has 55 places, 87 transitions, 2061 flow [2022-12-13 08:40:42,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:42,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:42,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 87 transitions, 2061 flow [2022-12-13 08:40:42,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 87 transitions, 2061 flow [2022-12-13 08:40:42,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:42,502 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:42,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:40:42,503 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 87 transitions, 2061 flow [2022-12-13 08:40:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 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-13 08:40:42,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:42,504 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:42,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:42,710 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-13 08:40:42,710 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:42,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 761626992, now seen corresponding path program 1 times [2022-12-13 08:40:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:42,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081908197] [2022-12-13 08:40:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:43,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081908197] [2022-12-13 08:40:43,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081908197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:43,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585713154] [2022-12-13 08:40:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:43,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:43,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:43,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 08:40:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:43,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 08:40:43,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:43,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:43,642 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:43,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:43,720 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-13 08:40:43,720 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-13 08:40:43,775 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-13 08:40:43,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585713154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:43,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:43,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2022-12-13 08:40:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859607549] [2022-12-13 08:40:43,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 08:40:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 08:40:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 08:40:43,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 08:40:43,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 87 transitions, 2061 flow. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:43,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:43,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 08:40:43,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:44,172 INFO L130 PetriNetUnfolder]: 226/400 cut-off events. [2022-12-13 08:40:44,172 INFO L131 PetriNetUnfolder]: For 1549/1549 co-relation queries the response was YES. [2022-12-13 08:40:44,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5034 conditions, 400 events. 226/400 cut-off events. For 1549/1549 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1400 event pairs, 8 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 3620. Up to 365 conditions per place. [2022-12-13 08:40:44,178 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 110 selfloop transitions, 41 changer transitions 1/158 dead transitions. [2022-12-13 08:40:44,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 158 transitions, 4102 flow [2022-12-13 08:40:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 08:40:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 08:40:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-12-13 08:40:44,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2022-12-13 08:40:44,180 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2022-12-13 08:40:44,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 158 transitions, 4102 flow [2022-12-13 08:40:44,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 157 transitions, 4073 flow [2022-12-13 08:40:44,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:44,192 INFO L89 Accepts]: Start accepts. Operand has 66 places, 157 transitions, 4073 flow [2022-12-13 08:40:44,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:44,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:44,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 157 transitions, 4073 flow [2022-12-13 08:40:44,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 157 transitions, 4073 flow [2022-12-13 08:40:44,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:46,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:40:46,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2086 [2022-12-13 08:40:46,278 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 156 transitions, 4047 flow [2022-12-13 08:40:46,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:46,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:46,279 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:46,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:46,484 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-13 08:40:46,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash -351319238, now seen corresponding path program 1 times [2022-12-13 08:40:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:46,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78862518] [2022-12-13 08:40:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:47,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78862518] [2022-12-13 08:40:47,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78862518] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:47,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880956053] [2022-12-13 08:40:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:47,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:47,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:47,049 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:47,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 08:40:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:47,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 08:40:47,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:47,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:47,226 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:47,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:47,307 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-13 08:40:47,308 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-13 08:40:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:47,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880956053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:47,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:47,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 08:40:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606449188] [2022-12-13 08:40:47,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:47,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 08:40:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 08:40:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 08:40:47,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:47,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 156 transitions, 4047 flow. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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-13 08:40:47,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:47,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:47,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:47,628 INFO L130 PetriNetUnfolder]: 362/643 cut-off events. [2022-12-13 08:40:47,628 INFO L131 PetriNetUnfolder]: For 2879/2879 co-relation queries the response was YES. [2022-12-13 08:40:47,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 643 events. 362/643 cut-off events. For 2879/2879 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2685 event pairs, 5 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 5463. Up to 596 conditions per place. [2022-12-13 08:40:47,638 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 176 selfloop transitions, 56 changer transitions 1/239 dead transitions. [2022-12-13 08:40:47,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 239 transitions, 6722 flow [2022-12-13 08:40:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:40:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:40:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-12-13 08:40:47,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2022-12-13 08:40:47,640 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2022-12-13 08:40:47,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 239 transitions, 6722 flow [2022-12-13 08:40:47,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 238 transitions, 6691 flow [2022-12-13 08:40:47,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:47,659 INFO L89 Accepts]: Start accepts. Operand has 73 places, 238 transitions, 6691 flow [2022-12-13 08:40:47,662 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:47,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:47,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 238 transitions, 6691 flow [2022-12-13 08:40:47,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 238 transitions, 6691 flow [2022-12-13 08:40:47,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:47,668 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:47,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 08:40:47,669 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 238 transitions, 6691 flow [2022-12-13 08:40:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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-13 08:40:47,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:47,669 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:47,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:47,875 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-13 08:40:47,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash -650379758, now seen corresponding path program 2 times [2022-12-13 08:40:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:47,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570388537] [2022-12-13 08:40:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:48,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570388537] [2022-12-13 08:40:48,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570388537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:48,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542329650] [2022-12-13 08:40:48,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:40:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:48,351 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:48,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 08:40:48,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:48,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:48,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 08:40:48,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:48,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:48,538 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:48,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:48,615 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-13 08:40:48,615 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-13 08:40:48,665 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-13 08:40:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542329650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:48,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:48,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 08:40:48,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352743575] [2022-12-13 08:40:48,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:48,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 08:40:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:48,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 08:40:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 08:40:48,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:48,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 238 transitions, 6691 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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-13 08:40:48,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:48,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:48,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:49,017 INFO L130 PetriNetUnfolder]: 458/811 cut-off events. [2022-12-13 08:40:49,019 INFO L131 PetriNetUnfolder]: For 4072/4072 co-relation queries the response was YES. [2022-12-13 08:40:49,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11799 conditions, 811 events. 458/811 cut-off events. For 4072/4072 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3646 event pairs, 6 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 7108. Up to 756 conditions per place. [2022-12-13 08:40:49,031 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 250 selfloop transitions, 34 changer transitions 1/291 dead transitions. [2022-12-13 08:40:49,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 291 transitions, 8763 flow [2022-12-13 08:40:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:40:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:40:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-12-13 08:40:49,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2022-12-13 08:40:49,033 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 60 predicate places. [2022-12-13 08:40:49,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 291 transitions, 8763 flow [2022-12-13 08:40:49,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 290 transitions, 8730 flow [2022-12-13 08:40:49,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:49,053 INFO L89 Accepts]: Start accepts. Operand has 81 places, 290 transitions, 8730 flow [2022-12-13 08:40:49,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:49,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:49,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 290 transitions, 8730 flow [2022-12-13 08:40:49,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 290 transitions, 8730 flow [2022-12-13 08:40:49,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:49,065 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:49,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 08:40:49,066 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 290 transitions, 8730 flow [2022-12-13 08:40:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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-13 08:40:49,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:49,066 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:49,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:49,272 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-13 08:40:49,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1007874280, now seen corresponding path program 3 times [2022-12-13 08:40:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:49,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851209460] [2022-12-13 08:40:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:50,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851209460] [2022-12-13 08:40:50,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851209460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:50,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932471436] [2022-12-13 08:40:50,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:40:50,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:50,152 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:50,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 08:40:50,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:40:50,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:50,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 08:40:50,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:50,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:50,335 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 14 treesize of output 16 [2022-12-13 08:40:50,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:50,396 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:50,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:50,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~f~0.base))) (= (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset))))) is different from false [2022-12-13 08:40:50,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:50,490 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 08:40:50,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:50,509 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 08:40:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:50,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932471436] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:50,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:50,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 08:40:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393631709] [2022-12-13 08:40:50,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:40:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:50,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:40:50,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2022-12-13 08:40:50,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:50,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 290 transitions, 8730 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:50,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:50,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:50,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:51,144 INFO L130 PetriNetUnfolder]: 519/921 cut-off events. [2022-12-13 08:40:51,145 INFO L131 PetriNetUnfolder]: For 5345/5345 co-relation queries the response was YES. [2022-12-13 08:40:51,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14305 conditions, 921 events. 519/921 cut-off events. For 5345/5345 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4273 event pairs, 10 based on Foata normal form. 1/722 useless extension candidates. Maximal degree in co-relation 8464. Up to 864 conditions per place. [2022-12-13 08:40:51,155 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 268 selfloop transitions, 51 changer transitions 1/326 dead transitions. [2022-12-13 08:40:51,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 326 transitions, 10471 flow [2022-12-13 08:40:51,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:40:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:40:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-12-13 08:40:51,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2022-12-13 08:40:51,157 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 68 predicate places. [2022-12-13 08:40:51,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 326 transitions, 10471 flow [2022-12-13 08:40:51,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 325 transitions, 10436 flow [2022-12-13 08:40:51,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:51,180 INFO L89 Accepts]: Start accepts. Operand has 89 places, 325 transitions, 10436 flow [2022-12-13 08:40:51,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:51,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:51,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 325 transitions, 10436 flow [2022-12-13 08:40:51,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 325 transitions, 10436 flow [2022-12-13 08:40:51,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:51,193 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:51,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 08:40:51,194 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 325 transitions, 10436 flow [2022-12-13 08:40:51,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:51,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:51,194 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:51,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:51,401 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-13 08:40:51,402 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 662977240, now seen corresponding path program 4 times [2022-12-13 08:40:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:51,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108964704] [2022-12-13 08:40:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:52,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108964704] [2022-12-13 08:40:52,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108964704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:52,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792783953] [2022-12-13 08:40:52,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:40:52,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:52,192 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:52,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 08:40:52,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:40:52,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:52,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 08:40:52,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:52,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:52,338 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 14 treesize of output 16 [2022-12-13 08:40:52,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:52,396 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:52,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:52,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:52,500 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 08:40:52,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:52,519 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 08:40:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:52,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792783953] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:52,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:52,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 08:40:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890537300] [2022-12-13 08:40:52,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:52,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:40:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:40:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=160, Unknown=5, NotChecked=0, Total=210 [2022-12-13 08:40:52,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:52,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 325 transitions, 10436 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:52,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:52,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:52,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:53,078 INFO L130 PetriNetUnfolder]: 593/1055 cut-off events. [2022-12-13 08:40:53,079 INFO L131 PetriNetUnfolder]: For 7282/7282 co-relation queries the response was YES. [2022-12-13 08:40:53,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17396 conditions, 1055 events. 593/1055 cut-off events. For 7282/7282 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5080 event pairs, 10 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 10367. Up to 992 conditions per place. [2022-12-13 08:40:53,118 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 293 selfloop transitions, 69 changer transitions 1/369 dead transitions. [2022-12-13 08:40:53,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 369 transitions, 12600 flow [2022-12-13 08:40:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:40:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:40:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-12-13 08:40:53,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2022-12-13 08:40:53,120 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 76 predicate places. [2022-12-13 08:40:53,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 369 transitions, 12600 flow [2022-12-13 08:40:53,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 368 transitions, 12563 flow [2022-12-13 08:40:53,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:53,141 INFO L89 Accepts]: Start accepts. Operand has 97 places, 368 transitions, 12563 flow [2022-12-13 08:40:53,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:53,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:53,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 368 transitions, 12563 flow [2022-12-13 08:40:53,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 368 transitions, 12563 flow [2022-12-13 08:40:53,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:53,158 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:53,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 08:40:53,159 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 368 transitions, 12563 flow [2022-12-13 08:40:53,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:53,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:53,159 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:53,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:53,365 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-13 08:40:53,365 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash -887791834, now seen corresponding path program 5 times [2022-12-13 08:40:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:53,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750488853] [2022-12-13 08:40:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:53,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750488853] [2022-12-13 08:40:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750488853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007335729] [2022-12-13 08:40:54,046 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:40:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:54,048 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:54,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 08:40:54,149 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:54,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:54,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 08:40:54,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:54,242 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 22 treesize of output 22 [2022-12-13 08:40:54,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:40:54,296 INFO L321 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2022-12-13 08:40:54,296 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 31 [2022-12-13 08:40:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:54,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:54,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:54,429 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 112 [2022-12-13 08:40:54,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:54,440 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 28 [2022-12-13 08:40:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:54,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007335729] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:54,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:54,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-13 08:40:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763482252] [2022-12-13 08:40:54,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:54,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 08:40:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 08:40:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=149, Unknown=1, NotChecked=0, Total=182 [2022-12-13 08:40:54,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:54,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 368 transitions, 12563 flow. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:54,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:54,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:54,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:55,261 INFO L130 PetriNetUnfolder]: 707/1263 cut-off events. [2022-12-13 08:40:55,261 INFO L131 PetriNetUnfolder]: For 9634/9634 co-relation queries the response was YES. [2022-12-13 08:40:55,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22082 conditions, 1263 events. 707/1263 cut-off events. For 9634/9634 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6402 event pairs, 10 based on Foata normal form. 1/962 useless extension candidates. Maximal degree in co-relation 11682. Up to 1194 conditions per place. [2022-12-13 08:40:55,273 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 364 selfloop transitions, 60 changer transitions 1/431 dead transitions. [2022-12-13 08:40:55,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 431 transitions, 15597 flow [2022-12-13 08:40:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:40:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:40:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-13 08:40:55,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2022-12-13 08:40:55,274 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-13 08:40:55,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 431 transitions, 15597 flow [2022-12-13 08:40:55,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 430 transitions, 15558 flow [2022-12-13 08:40:55,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:55,347 INFO L89 Accepts]: Start accepts. Operand has 105 places, 430 transitions, 15558 flow [2022-12-13 08:40:55,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:55,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:55,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 430 transitions, 15558 flow [2022-12-13 08:40:55,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 430 transitions, 15558 flow [2022-12-13 08:40:55,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:55,365 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:55,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 08:40:55,366 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 430 transitions, 15558 flow [2022-12-13 08:40:55,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:55,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:55,366 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:55,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 08:40:55,572 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-13 08:40:55,573 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1610127441, now seen corresponding path program 1 times [2022-12-13 08:40:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:55,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751985893] [2022-12-13 08:40:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751985893] [2022-12-13 08:40:55,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751985893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964741021] [2022-12-13 08:40:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:55,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:55,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 08:40:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:55,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 08:40:55,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:56,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:56,090 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 22 treesize of output 22 [2022-12-13 08:40:56,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:56,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:56,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:56,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (= c_~x1~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_526) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-13 08:40:56,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (= (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_526) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-13 08:40:56,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:56,201 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 112 [2022-12-13 08:40:56,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:56,214 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 28 [2022-12-13 08:40:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 08:40:56,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964741021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:56,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:56,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:40:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413167013] [2022-12-13 08:40:56,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:56,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:40:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:56,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:40:56,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=191, Unknown=2, NotChecked=58, Total=306 [2022-12-13 08:40:56,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:56,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 430 transitions, 15558 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:56,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:56,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:56,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:56,870 INFO L130 PetriNetUnfolder]: 933/1629 cut-off events. [2022-12-13 08:40:56,870 INFO L131 PetriNetUnfolder]: For 12445/12445 co-relation queries the response was YES. [2022-12-13 08:40:56,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30179 conditions, 1629 events. 933/1629 cut-off events. For 12445/12445 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8516 event pairs, 12 based on Foata normal form. 1/1201 useless extension candidates. Maximal degree in co-relation 15993. Up to 1554 conditions per place. [2022-12-13 08:40:56,888 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 414 selfloop transitions, 125 changer transitions 1/546 dead transitions. [2022-12-13 08:40:56,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 546 transitions, 20862 flow [2022-12-13 08:40:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:40:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:40:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 08:40:56,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-13 08:40:56,892 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-13 08:40:56,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 546 transitions, 20862 flow [2022-12-13 08:40:56,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 545 transitions, 20821 flow [2022-12-13 08:40:56,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:56,928 INFO L89 Accepts]: Start accepts. Operand has 112 places, 545 transitions, 20821 flow [2022-12-13 08:40:56,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:56,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:56,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 545 transitions, 20821 flow [2022-12-13 08:40:56,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 545 transitions, 20821 flow [2022-12-13 08:40:56,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:56,954 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:56,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 08:40:56,955 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 545 transitions, 20821 flow [2022-12-13 08:40:56,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:56,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:56,955 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:56,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:57,170 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-13 08:40:57,170 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -28591235, now seen corresponding path program 2 times [2022-12-13 08:40:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:57,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34081675] [2022-12-13 08:40:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:57,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:57,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34081675] [2022-12-13 08:40:57,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34081675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:57,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598741118] [2022-12-13 08:40:57,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:40:57,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:57,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:57,544 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:57,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 08:40:57,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:57,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:57,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:40:57,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:57,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:57,714 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 14 treesize of output 16 [2022-12-13 08:40:57,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:57,775 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 08:40:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:57,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:57,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:57,915 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 08:40:57,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:57,935 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 08:40:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:58,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598741118] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:58,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:58,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:40:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588297081] [2022-12-13 08:40:58,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:40:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:40:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:40:58,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:40:58,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 545 transitions, 20821 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:58,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:58,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:40:58,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:58,931 INFO L130 PetriNetUnfolder]: 1103/1938 cut-off events. [2022-12-13 08:40:58,932 INFO L131 PetriNetUnfolder]: For 16176/16176 co-relation queries the response was YES. [2022-12-13 08:40:58,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37815 conditions, 1938 events. 1103/1938 cut-off events. For 16176/16176 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10454 event pairs, 8 based on Foata normal form. 2/1418 useless extension candidates. Maximal degree in co-relation 19020. Up to 1853 conditions per place. [2022-12-13 08:40:58,950 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 555 selfloop transitions, 79 changer transitions 2/642 dead transitions. [2022-12-13 08:40:58,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 642 transitions, 25836 flow [2022-12-13 08:40:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:40:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:40:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-12-13 08:40:58,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-13 08:40:58,952 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-13 08:40:58,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 642 transitions, 25836 flow [2022-12-13 08:40:58,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 640 transitions, 25750 flow [2022-12-13 08:40:58,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:58,995 INFO L89 Accepts]: Start accepts. Operand has 122 places, 640 transitions, 25750 flow [2022-12-13 08:40:59,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:59,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:59,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 640 transitions, 25750 flow [2022-12-13 08:40:59,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 640 transitions, 25750 flow [2022-12-13 08:40:59,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:59,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:59,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 08:40:59,028 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 640 transitions, 25750 flow [2022-12-13 08:40:59,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:59,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:59,029 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:59,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:59,231 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-13 08:40:59,232 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 737839933, now seen corresponding path program 6 times [2022-12-13 08:40:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164856967] [2022-12-13 08:40:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:59,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164856967] [2022-12-13 08:40:59,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164856967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:59,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505671096] [2022-12-13 08:40:59,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:40:59,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:59,448 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:59,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 08:40:59,553 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 08:40:59,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:59,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:40:59,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:59,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:59,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505671096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:59,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:59,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-13 08:40:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883593270] [2022-12-13 08:40:59,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:59,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:40:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:40:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:40:59,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:40:59,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 640 transitions, 25750 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:59,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:59,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:40:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:01,260 INFO L130 PetriNetUnfolder]: 1375/2578 cut-off events. [2022-12-13 08:41:01,260 INFO L131 PetriNetUnfolder]: For 17105/17105 co-relation queries the response was YES. [2022-12-13 08:41:01,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53199 conditions, 2578 events. 1375/2578 cut-off events. For 17105/17105 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16042 event pairs, 0 based on Foata normal form. 0/1932 useless extension candidates. Maximal degree in co-relation 26306. Up to 2487 conditions per place. [2022-12-13 08:41:01,277 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 795 selfloop transitions, 307 changer transitions 222/1324 dead transitions. [2022-12-13 08:41:01,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1324 transitions, 55945 flow [2022-12-13 08:41:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 08:41:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 08:41:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 130 transitions. [2022-12-13 08:41:01,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3140096618357488 [2022-12-13 08:41:01,285 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-13 08:41:01,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 1324 transitions, 55945 flow [2022-12-13 08:41:01,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 1102 transitions, 46484 flow [2022-12-13 08:41:01,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:01,334 INFO L89 Accepts]: Start accepts. Operand has 142 places, 1102 transitions, 46484 flow [2022-12-13 08:41:01,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:01,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:01,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 1102 transitions, 46484 flow [2022-12-13 08:41:01,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 1102 transitions, 46484 flow [2022-12-13 08:41:01,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:01,409 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:01,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 08:41:01,410 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 1102 transitions, 46484 flow [2022-12-13 08:41:01,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:01,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:01,410 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:01,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:01,618 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-13 08:41:01,619 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 243952995, now seen corresponding path program 7 times [2022-12-13 08:41:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:01,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710382392] [2022-12-13 08:41:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710382392] [2022-12-13 08:41:01,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710382392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:01,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437845805] [2022-12-13 08:41:01,779 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:41:01,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:01,780 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:01,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 08:41:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:01,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:01,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:01,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:02,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437845805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:02,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:02,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-12-13 08:41:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690446202] [2022-12-13 08:41:02,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:02,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:41:02,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:41:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:41:02,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:02,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 1102 transitions, 46484 flow. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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-13 08:41:02,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:02,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:02,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:03,670 INFO L130 PetriNetUnfolder]: 1186/2190 cut-off events. [2022-12-13 08:41:03,671 INFO L131 PetriNetUnfolder]: For 13459/13459 co-relation queries the response was YES. [2022-12-13 08:41:03,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47454 conditions, 2190 events. 1186/2190 cut-off events. For 13459/13459 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12733 event pairs, 0 based on Foata normal form. 8/1659 useless extension candidates. Maximal degree in co-relation 25352. Up to 2119 conditions per place. [2022-12-13 08:41:03,694 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 972 selfloop transitions, 140 changer transitions 18/1130 dead transitions. [2022-12-13 08:41:03,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1130 transitions, 49929 flow [2022-12-13 08:41:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:41:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:41:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-12-13 08:41:03,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 08:41:03,696 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-13 08:41:03,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 1130 transitions, 49929 flow [2022-12-13 08:41:03,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 1112 transitions, 49150 flow [2022-12-13 08:41:03,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:03,757 INFO L89 Accepts]: Start accepts. Operand has 150 places, 1112 transitions, 49150 flow [2022-12-13 08:41:03,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:03,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:03,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 1112 transitions, 49150 flow [2022-12-13 08:41:03,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 1112 transitions, 49150 flow [2022-12-13 08:41:03,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:03,822 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:03,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 08:41:03,823 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 1112 transitions, 49150 flow [2022-12-13 08:41:03,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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-13 08:41:03,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:03,823 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:03,830 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-13 08:41:04,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-13 08:41:04,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-13 08:41:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1800556447, now seen corresponding path program 8 times [2022-12-13 08:41:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:04,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113891052] [2022-12-13 08:41:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:04,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:04,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113891052] [2022-12-13 08:41:04,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113891052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:04,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929984536] [2022-12-13 08:41:04,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:41:04,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:04,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:04,184 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:04,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 08:41:04,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:41:04,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:04,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:04,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:04,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:04,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929984536] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:04,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:04,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 08:41:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352761147] [2022-12-13 08:41:04,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:04,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:04,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:04,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 1112 transitions, 49150 flow. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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-13 08:41:04,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:04,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:04,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:06,627 INFO L130 PetriNetUnfolder]: 1273/2403 cut-off events. [2022-12-13 08:41:06,627 INFO L131 PetriNetUnfolder]: For 12578/12578 co-relation queries the response was YES. [2022-12-13 08:41:06,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54570 conditions, 2403 events. 1273/2403 cut-off events. For 12578/12578 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14598 event pairs, 0 based on Foata normal form. 4/1824 useless extension candidates. Maximal degree in co-relation 28708. Up to 2332 conditions per place. [2022-12-13 08:41:06,646 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 983 selfloop transitions, 327 changer transitions 24/1334 dead transitions. [2022-12-13 08:41:06,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1334 transitions, 61651 flow [2022-12-13 08:41:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 08:41:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 08:41:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2022-12-13 08:41:06,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391812865497076 [2022-12-13 08:41:06,648 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 147 predicate places. [2022-12-13 08:41:06,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 1334 transitions, 61651 flow [2022-12-13 08:41:06,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 1310 transitions, 60541 flow [2022-12-13 08:41:06,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:06,709 INFO L89 Accepts]: Start accepts. Operand has 168 places, 1310 transitions, 60541 flow [2022-12-13 08:41:06,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:06,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:06,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 1310 transitions, 60541 flow [2022-12-13 08:41:06,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 1310 transitions, 60541 flow [2022-12-13 08:41:06,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:06,776 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:06,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 08:41:06,777 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 1310 transitions, 60541 flow [2022-12-13 08:41:06,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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-13 08:41:06,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:06,777 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:06,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:06,983 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-13 08:41:06,984 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1436830057, now seen corresponding path program 9 times [2022-12-13 08:41:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:06,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460158382] [2022-12-13 08:41:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:07,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:07,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460158382] [2022-12-13 08:41:07,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460158382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:07,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656420889] [2022-12-13 08:41:07,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:41:07,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:07,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:07,139 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:07,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 08:41:07,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:41:07,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:07,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:07,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:07,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:07,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656420889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:07,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:07,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 08:41:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060579708] [2022-12-13 08:41:07,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:07,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:41:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:41:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:41:07,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:07,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 1310 transitions, 60541 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:07,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:07,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:07,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:09,328 INFO L130 PetriNetUnfolder]: 1192/2194 cut-off events. [2022-12-13 08:41:09,329 INFO L131 PetriNetUnfolder]: For 12710/12710 co-relation queries the response was YES. [2022-12-13 08:41:09,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51910 conditions, 2194 events. 1192/2194 cut-off events. For 12710/12710 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12624 event pairs, 0 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 29064. Up to 2123 conditions per place. [2022-12-13 08:41:09,346 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 936 selfloop transitions, 295 changer transitions 0/1231 dead transitions. [2022-12-13 08:41:09,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:41:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 08:41:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-12-13 08:41:09,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2022-12-13 08:41:09,348 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 161 predicate places. [2022-12-13 08:41:09,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:09,398 INFO L89 Accepts]: Start accepts. Operand has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:09,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:09,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:09,451 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:09,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 08:41:09,451 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1231 transitions, 59243 flow [2022-12-13 08:41:09,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:09,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:09,452 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:09,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:09,657 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-13 08:41:09,657 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -970306519, now seen corresponding path program 10 times [2022-12-13 08:41:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726168385] [2022-12-13 08:41:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726168385] [2022-12-13 08:41:09,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726168385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958604695] [2022-12-13 08:41:09,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:41:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:09,923 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:09,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 08:41:10,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:41:10,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:10,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:10,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:10,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:10,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958604695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:10,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:10,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-13 08:41:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7211522] [2022-12-13 08:41:10,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:10,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:41:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:10,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:41:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:41:10,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:10,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1231 transitions, 59243 flow. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:10,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:10,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:10,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:12,663 INFO L130 PetriNetUnfolder]: 1207/2341 cut-off events. [2022-12-13 08:41:12,663 INFO L131 PetriNetUnfolder]: For 12740/12740 co-relation queries the response was YES. [2022-12-13 08:41:12,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57805 conditions, 2341 events. 1207/2341 cut-off events. For 12740/12740 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14450 event pairs, 0 based on Foata normal form. 46/1894 useless extension candidates. Maximal degree in co-relation 32469. Up to 2270 conditions per place. [2022-12-13 08:41:12,682 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 937 selfloop transitions, 393 changer transitions 46/1376 dead transitions. [2022-12-13 08:41:12,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1376 transitions, 69042 flow [2022-12-13 08:41:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 08:41:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 08:41:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-12-13 08:41:12,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26296296296296295 [2022-12-13 08:41:12,684 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-13 08:41:12,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 1376 transitions, 69042 flow [2022-12-13 08:41:12,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 1330 transitions, 66715 flow [2022-12-13 08:41:12,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:12,738 INFO L89 Accepts]: Start accepts. Operand has 210 places, 1330 transitions, 66715 flow [2022-12-13 08:41:12,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:12,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:12,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 1330 transitions, 66715 flow [2022-12-13 08:41:12,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 1330 transitions, 66715 flow [2022-12-13 08:41:12,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:12,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:12,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 08:41:12,799 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 1330 transitions, 66715 flow [2022-12-13 08:41:12,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:12,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:12,799 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:12,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:13,007 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-13 08:41:13,008 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1292434493, now seen corresponding path program 11 times [2022-12-13 08:41:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:13,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255559502] [2022-12-13 08:41:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255559502] [2022-12-13 08:41:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255559502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453414533] [2022-12-13 08:41:13,153 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:41:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:13,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:13,156 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:13,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 08:41:13,258 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 08:41:13,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:13,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:13,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:13,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:13,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453414533] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:13,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:13,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 08:41:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110242336] [2022-12-13 08:41:13,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:13,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:13,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:13,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:13,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1330 transitions, 66715 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:13,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:13,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:13,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:16,752 INFO L130 PetriNetUnfolder]: 1355/2608 cut-off events. [2022-12-13 08:41:16,753 INFO L131 PetriNetUnfolder]: For 13169/13169 co-relation queries the response was YES. [2022-12-13 08:41:16,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67094 conditions, 2608 events. 1355/2608 cut-off events. For 13169/13169 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16434 event pairs, 0 based on Foata normal form. 0/2086 useless extension candidates. Maximal degree in co-relation 40182. Up to 2537 conditions per place. [2022-12-13 08:41:16,776 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 1115 selfloop transitions, 423 changer transitions 0/1538 dead transitions. [2022-12-13 08:41:16,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 08:41:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 08:41:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 187 transitions. [2022-12-13 08:41:16,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26638176638176636 [2022-12-13 08:41:16,779 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 227 predicate places. [2022-12-13 08:41:16,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:16,844 INFO L89 Accepts]: Start accepts. Operand has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:16,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:16,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:16,900 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:16,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 08:41:16,901 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 1538 transitions, 80233 flow [2022-12-13 08:41:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:16,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:16,901 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:16,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:17,105 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-13 08:41:17,106 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1702412925, now seen corresponding path program 12 times [2022-12-13 08:41:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:17,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544252395] [2022-12-13 08:41:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544252395] [2022-12-13 08:41:17,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544252395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489289239] [2022-12-13 08:41:17,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:41:17,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:17,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:17,308 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:17,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 08:41:17,423 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 08:41:17,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:17,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:17,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489289239] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:17,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:17,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-13 08:41:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106497482] [2022-12-13 08:41:17,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:17,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:17,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1538 transitions, 80233 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:17,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:17,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:17,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:21,498 INFO L130 PetriNetUnfolder]: 1456/2833 cut-off events. [2022-12-13 08:41:21,498 INFO L131 PetriNetUnfolder]: For 13181/13181 co-relation queries the response was YES. [2022-12-13 08:41:21,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75791 conditions, 2833 events. 1456/2833 cut-off events. For 13181/13181 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18484 event pairs, 0 based on Foata normal form. 40/2297 useless extension candidates. Maximal degree in co-relation 47172. Up to 2762 conditions per place. [2022-12-13 08:41:21,529 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 1161 selfloop transitions, 481 changer transitions 49/1691 dead transitions. [2022-12-13 08:41:21,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 1691 transitions, 91610 flow [2022-12-13 08:41:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 08:41:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-13 08:41:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 211 transitions. [2022-12-13 08:41:21,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26641414141414144 [2022-12-13 08:41:21,531 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2022-12-13 08:41:21,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 1691 transitions, 91610 flow [2022-12-13 08:41:21,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 1642 transitions, 88943 flow [2022-12-13 08:41:21,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:21,623 INFO L89 Accepts]: Start accepts. Operand has 288 places, 1642 transitions, 88943 flow [2022-12-13 08:41:21,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:21,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:21,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 1642 transitions, 88943 flow [2022-12-13 08:41:21,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 1642 transitions, 88943 flow [2022-12-13 08:41:21,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:21,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:21,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 08:41:21,696 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 1642 transitions, 88943 flow [2022-12-13 08:41:21,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:21,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:21,696 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:21,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 08:41:21,897 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-13 08:41:21,897 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889387, now seen corresponding path program 13 times [2022-12-13 08:41:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:21,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528295223] [2022-12-13 08:41:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:22,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528295223] [2022-12-13 08:41:22,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528295223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:22,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516504920] [2022-12-13 08:41:22,080 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:41:22,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:22,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:22,082 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:22,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 08:41:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:22,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:22,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:22,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:22,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516504920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:22,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:22,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 08:41:22,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060806784] [2022-12-13 08:41:22,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:22,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:22,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:22,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1642 transitions, 88943 flow. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:22,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:22,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:22,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:25,608 INFO L130 PetriNetUnfolder]: 1443/2786 cut-off events. [2022-12-13 08:41:25,609 INFO L131 PetriNetUnfolder]: For 13170/13170 co-relation queries the response was YES. [2022-12-13 08:41:25,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77299 conditions, 2786 events. 1443/2786 cut-off events. For 13170/13170 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17926 event pairs, 0 based on Foata normal form. 0/2240 useless extension candidates. Maximal degree in co-relation 48824. Up to 2715 conditions per place. [2022-12-13 08:41:25,636 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 1294 selfloop transitions, 363 changer transitions 0/1657 dead transitions. [2022-12-13 08:41:25,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 08:41:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 08:41:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 140 transitions. [2022-12-13 08:41:25,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29914529914529914 [2022-12-13 08:41:25,638 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 290 predicate places. [2022-12-13 08:41:25,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:25,716 INFO L89 Accepts]: Start accepts. Operand has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:25,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:25,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:25,786 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:25,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 08:41:25,787 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 1657 transitions, 93058 flow [2022-12-13 08:41:25,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:25,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:25,787 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:25,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 08:41:25,993 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-13 08:41:25,993 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1752608663, now seen corresponding path program 14 times [2022-12-13 08:41:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:25,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860891880] [2022-12-13 08:41:25,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:26,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860891880] [2022-12-13 08:41:26,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860891880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:26,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984344776] [2022-12-13 08:41:26,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:41:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:26,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:26,187 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:26,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 08:41:26,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:41:26,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:26,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:26,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:26,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:26,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984344776] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:26,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:26,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 08:41:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311251039] [2022-12-13 08:41:26,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:26,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:41:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:26,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:41:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:41:26,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:26,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1657 transitions, 93058 flow. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:26,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:26,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:32,696 INFO L130 PetriNetUnfolder]: 1952/3787 cut-off events. [2022-12-13 08:41:32,696 INFO L131 PetriNetUnfolder]: For 13236/13236 co-relation queries the response was YES. [2022-12-13 08:41:32,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109168 conditions, 3787 events. 1952/3787 cut-off events. For 13236/13236 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26442 event pairs, 0 based on Foata normal form. 0/3039 useless extension candidates. Maximal degree in co-relation 74567. Up to 3716 conditions per place. [2022-12-13 08:41:32,731 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 1633 selfloop transitions, 651 changer transitions 0/2284 dead transitions. [2022-12-13 08:41:32,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 08:41:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-13 08:41:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 263 transitions. [2022-12-13 08:41:32,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24764595103578155 [2022-12-13 08:41:32,734 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 348 predicate places. [2022-12-13 08:41:32,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:32,843 INFO L89 Accepts]: Start accepts. Operand has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:32,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:32,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:32,947 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:32,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 08:41:32,948 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 2284 transitions, 132897 flow [2022-12-13 08:41:32,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:32,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:32,948 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:32,953 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-13 08:41:33,150 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-13 08:41:33,150 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1342630231, now seen corresponding path program 15 times [2022-12-13 08:41:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:33,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432283473] [2022-12-13 08:41:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:33,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432283473] [2022-12-13 08:41:33,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432283473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:33,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823704490] [2022-12-13 08:41:33,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:41:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:33,333 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:33,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 08:41:33,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:41:33,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:33,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:33,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:33,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823704490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:33,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:33,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-13 08:41:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161104600] [2022-12-13 08:41:33,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:33,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:33,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 2284 transitions, 132897 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:33,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:33,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:33,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:42,111 INFO L130 PetriNetUnfolder]: 2124/4209 cut-off events. [2022-12-13 08:41:42,112 INFO L131 PetriNetUnfolder]: For 13245/13245 co-relation queries the response was YES. [2022-12-13 08:41:42,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125583 conditions, 4209 events. 2124/4209 cut-off events. For 13245/13245 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 30722 event pairs, 0 based on Foata normal form. 34/3441 useless extension candidates. Maximal degree in co-relation 89666. Up to 4134 conditions per place. [2022-12-13 08:41:42,152 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 1857 selfloop transitions, 700 changer transitions 48/2605 dead transitions. [2022-12-13 08:41:42,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 2605 transitions, 156766 flow [2022-12-13 08:41:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 08:41:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-12-13 08:41:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 243 transitions. [2022-12-13 08:41:42,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25961538461538464 [2022-12-13 08:41:42,155 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 397 predicate places. [2022-12-13 08:41:42,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 418 places, 2605 transitions, 156766 flow [2022-12-13 08:41:42,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 414 places, 2557 transitions, 153865 flow [2022-12-13 08:41:42,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:42,279 INFO L89 Accepts]: Start accepts. Operand has 414 places, 2557 transitions, 153865 flow [2022-12-13 08:41:42,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:42,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:42,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 414 places, 2557 transitions, 153865 flow [2022-12-13 08:41:42,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 414 places, 2557 transitions, 153865 flow [2022-12-13 08:41:42,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:42,392 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:42,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 08:41:42,393 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 2557 transitions, 153865 flow [2022-12-13 08:41:42,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:42,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:42,393 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:42,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:42,594 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-13 08:41:42,594 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1639091359, now seen corresponding path program 16 times [2022-12-13 08:41:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:42,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370937161] [2022-12-13 08:41:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:42,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370937161] [2022-12-13 08:41:42,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370937161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:42,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821383013] [2022-12-13 08:41:42,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:41:42,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:42,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:42,878 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:42,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-13 08:41:42,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:41:42,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:42,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:42,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:43,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:43,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821383013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:43,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:43,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 08:41:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765773592] [2022-12-13 08:41:43,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:43,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:43,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:43,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 2557 transitions, 153865 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:43,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:43,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:43,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:49,977 INFO L130 PetriNetUnfolder]: 2474/4799 cut-off events. [2022-12-13 08:41:49,977 INFO L131 PetriNetUnfolder]: For 13238/13238 co-relation queries the response was YES. [2022-12-13 08:41:49,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148073 conditions, 4799 events. 2474/4799 cut-off events. For 13238/13238 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 35481 event pairs, 0 based on Foata normal form. 0/3911 useless extension candidates. Maximal degree in co-relation 112046. Up to 4724 conditions per place. [2022-12-13 08:41:50,032 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 2461 selfloop transitions, 495 changer transitions 0/2956 dead transitions. [2022-12-13 08:41:50,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 08:41:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 08:41:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 163 transitions. [2022-12-13 08:41:50,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2515432098765432 [2022-12-13 08:41:50,035 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 428 predicate places. [2022-12-13 08:41:50,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:50,178 INFO L89 Accepts]: Start accepts. Operand has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:50,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:50,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:50,313 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:50,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 08:41:50,314 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 2956 transitions, 183708 flow [2022-12-13 08:41:50,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:50,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:50,314 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:50,319 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-13 08:41:50,515 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-13 08:41:50,515 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1723471009, now seen corresponding path program 17 times [2022-12-13 08:41:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:50,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136114376] [2022-12-13 08:41:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:50,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136114376] [2022-12-13 08:41:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136114376] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017340088] [2022-12-13 08:41:50,684 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:41:50,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:50,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:50,688 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:50,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 08:41:50,827 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 08:41:50,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:50,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:41:50,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:50,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017340088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:50,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:50,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 08:41:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036951313] [2022-12-13 08:41:50,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:50,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:41:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:41:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:41:50,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:41:50,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 2956 transitions, 183708 flow. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:50,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:50,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:41:50,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:00,795 INFO L130 PetriNetUnfolder]: 2628/5185 cut-off events. [2022-12-13 08:42:00,796 INFO L131 PetriNetUnfolder]: For 13271/13271 co-relation queries the response was YES. [2022-12-13 08:42:00,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165259 conditions, 5185 events. 2628/5185 cut-off events. For 13271/13271 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 39451 event pairs, 0 based on Foata normal form. 0/4219 useless extension candidates. Maximal degree in co-relation 126323. Up to 5110 conditions per place. [2022-12-13 08:42:00,843 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 2476 selfloop transitions, 742 changer transitions 0/3218 dead transitions. [2022-12-13 08:42:00,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 08:42:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 08:42:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 153 transitions. [2022-12-13 08:42:00,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-13 08:42:00,845 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 453 predicate places. [2022-12-13 08:42:00,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:00,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:01,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:01,007 INFO L89 Accepts]: Start accepts. Operand has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:01,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:01,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:01,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:01,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:01,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:01,174 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:01,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 08:42:01,174 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 3218 transitions, 206490 flow [2022-12-13 08:42:01,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:01,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:01,175 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:01,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:01,378 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-13 08:42:01,378 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:01,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1900219161, now seen corresponding path program 18 times [2022-12-13 08:42:01,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:01,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318327839] [2022-12-13 08:42:01,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:01,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:01,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318327839] [2022-12-13 08:42:01,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318327839] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:01,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911444406] [2022-12-13 08:42:01,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:42:01,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:01,524 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:01,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 08:42:01,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 08:42:01,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:42:01,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:42:01,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:01,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:01,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911444406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:01,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:01,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-13 08:42:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673443755] [2022-12-13 08:42:01,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:01,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 08:42:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 08:42:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-13 08:42:01,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:42:01,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 3218 transitions, 206490 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:01,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:01,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:42:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:16,168 INFO L130 PetriNetUnfolder]: 3668/7351 cut-off events. [2022-12-13 08:42:16,169 INFO L131 PetriNetUnfolder]: For 14014/14014 co-relation queries the response was YES. [2022-12-13 08:42:16,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242014 conditions, 7351 events. 3668/7351 cut-off events. For 14014/14014 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 59785 event pairs, 0 based on Foata normal form. 0/5927 useless extension candidates. Maximal degree in co-relation 185225. Up to 7272 conditions per place. [2022-12-13 08:42:16,241 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 4152 selfloop transitions, 448 changer transitions 0/4600 dead transitions. [2022-12-13 08:42:16,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:42:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 08:42:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-12-13 08:42:16,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3373015873015873 [2022-12-13 08:42:16,244 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 466 predicate places. [2022-12-13 08:42:16,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:16,501 INFO L89 Accepts]: Start accepts. Operand has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:16,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:16,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:16,786 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:16,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 08:42:16,787 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 4600 transitions, 304465 flow [2022-12-13 08:42:16,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:16,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:16,787 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:16,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:16,991 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-13 08:42:16,992 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1082838029, now seen corresponding path program 19 times [2022-12-13 08:42:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:16,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119858496] [2022-12-13 08:42:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:17,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:17,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119858496] [2022-12-13 08:42:17,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119858496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:17,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062345588] [2022-12-13 08:42:17,118 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:42:17,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:17,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:17,120 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:17,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 08:42:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:17,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:42:17,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:17,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:17,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062345588] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:17,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:17,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 08:42:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282621746] [2022-12-13 08:42:17,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:17,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:42:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:42:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:42:17,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:42:17,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 4600 transitions, 304465 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:17,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:17,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:42:17,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:44,282 INFO L130 PetriNetUnfolder]: 4057/8030 cut-off events. [2022-12-13 08:42:44,283 INFO L131 PetriNetUnfolder]: For 13998/13998 co-relation queries the response was YES. [2022-12-13 08:42:44,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272440 conditions, 8030 events. 4057/8030 cut-off events. For 13998/13998 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 65676 event pairs, 0 based on Foata normal form. 0/6500 useless extension candidates. Maximal degree in co-relation 214892. Up to 7951 conditions per place. [2022-12-13 08:42:44,488 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 4275 selfloop transitions, 733 changer transitions 0/5008 dead transitions. [2022-12-13 08:42:44,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 08:42:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 08:42:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 149 transitions. [2022-12-13 08:42:44,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2759259259259259 [2022-12-13 08:42:44,490 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 495 predicate places. [2022-12-13 08:42:44,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:44,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:44,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:44,797 INFO L89 Accepts]: Start accepts. Operand has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:44,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:44,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:44,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:45,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:45,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:45,176 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:45,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-13 08:42:45,177 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 5008 transitions, 341373 flow [2022-12-13 08:42:45,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:45,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:45,177 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:45,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-13 08:42:45,381 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-13 08:42:45,382 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -998009357, now seen corresponding path program 20 times [2022-12-13 08:42:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:45,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676067056] [2022-12-13 08:42:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:45,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676067056] [2022-12-13 08:42:45,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676067056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:45,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956995009] [2022-12-13 08:42:45,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:42:45,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:45,553 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:45,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 08:42:45,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:42:45,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:42:45,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:42:45,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:45,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:45,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956995009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:45,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:45,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-13 08:42:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067616223] [2022-12-13 08:42:45,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:45,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:42:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:42:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:42:45,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:42:45,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 5008 transitions, 341373 flow. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:45,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:45,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:42:45,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:53,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 08:43:20,644 INFO L130 PetriNetUnfolder]: 4805/9652 cut-off events. [2022-12-13 08:43:20,644 INFO L131 PetriNetUnfolder]: For 14175/14175 co-relation queries the response was YES. [2022-12-13 08:43:20,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337228 conditions, 9652 events. 4805/9652 cut-off events. For 14175/14175 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 82761 event pairs, 0 based on Foata normal form. 0/7790 useless extension candidates. Maximal degree in co-relation 270096. Up to 9563 conditions per place. [2022-12-13 08:43:20,742 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 4943 selfloop transitions, 1116 changer transitions 0/6059 dead transitions. [2022-12-13 08:43:20,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 08:43:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 08:43:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 216 transitions. [2022-12-13 08:43:20,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-13 08:43:20,743 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 527 predicate places. [2022-12-13 08:43:20,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:21,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:21,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:43:21,200 INFO L89 Accepts]: Start accepts. Operand has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:21,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:43:21,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:43:21,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:21,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:21,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:43:21,604 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:43:21,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 405 [2022-12-13 08:43:21,605 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 6059 transitions, 425284 flow [2022-12-13 08:43:21,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:21,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:43:21,605 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:43:21,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 08:43:21,805 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-13 08:43:21,806 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:43:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:43:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash -617168579, now seen corresponding path program 21 times [2022-12-13 08:43:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:43:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357381903] [2022-12-13 08:43:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:43:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:43:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:43:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:43:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357381903] [2022-12-13 08:43:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357381903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:43:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772535563] [2022-12-13 08:43:21,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:43:21,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:43:21,995 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:43:21,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 08:43:22,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:43:22,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:43:22,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:43:22,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:43:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:22,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:43:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:22,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772535563] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:43:22,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:43:22,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-13 08:43:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570560213] [2022-12-13 08:43:22,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:43:22,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:43:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:43:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:43:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:43:22,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:43:22,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 6059 transitions, 425284 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:22,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:43:22,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:43:22,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:44:07,306 INFO L130 PetriNetUnfolder]: 4844/9857 cut-off events. [2022-12-13 08:44:07,306 INFO L131 PetriNetUnfolder]: For 14194/14194 co-relation queries the response was YES. [2022-12-13 08:44:07,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354295 conditions, 9857 events. 4844/9857 cut-off events. For 14194/14194 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 85876 event pairs, 0 based on Foata normal form. 26/7985 useless extension candidates. Maximal degree in co-relation 283991. Up to 9768 conditions per place. [2022-12-13 08:44:07,404 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 4481 selfloop transitions, 1695 changer transitions 66/6242 dead transitions. [2022-12-13 08:44:07,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 6242 transitions, 450680 flow [2022-12-13 08:44:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 08:44:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-13 08:44:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 246 transitions. [2022-12-13 08:44:07,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2789115646258503 [2022-12-13 08:44:07,406 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 574 predicate places. [2022-12-13 08:44:07,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 595 places, 6242 transitions, 450680 flow [2022-12-13 08:44:07,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 590 places, 6176 transitions, 445943 flow [2022-12-13 08:44:07,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:44:07,769 INFO L89 Accepts]: Start accepts. Operand has 590 places, 6176 transitions, 445943 flow [2022-12-13 08:44:07,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:44:07,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:44:07,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 590 places, 6176 transitions, 445943 flow [2022-12-13 08:44:08,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 590 places, 6176 transitions, 445943 flow [2022-12-13 08:44:08,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:44:08,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:44:08,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 504 [2022-12-13 08:44:08,272 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 6176 transitions, 445943 flow [2022-12-13 08:44:08,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:44:08,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:44:08,272 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:44:08,278 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-13 08:44:08,472 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-13 08:44:08,473 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:44:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:44:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1484692626, now seen corresponding path program 22 times [2022-12-13 08:44:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:44:08,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050576197] [2022-12-13 08:44:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:44:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:44:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:44:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:44:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:44:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050576197] [2022-12-13 08:44:08,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050576197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:44:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582632799] [2022-12-13 08:44:08,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:44:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:44:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:44:08,648 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:44:08,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 08:44:08,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:44:08,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:44:08,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:44:08,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:44:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:44:08,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:44:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:44:08,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582632799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:44:08,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:44:08,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 08:44:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958089544] [2022-12-13 08:44:08,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:44:08,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:44:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:44:08,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:44:08,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:44:08,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:44:08,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 6176 transitions, 445943 flow. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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-13 08:44:08,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:44:08,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:44:08,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:44:52,830 INFO L130 PetriNetUnfolder]: 4972/10097 cut-off events. [2022-12-13 08:44:52,830 INFO L131 PetriNetUnfolder]: For 13819/13819 co-relation queries the response was YES. [2022-12-13 08:44:52,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373117 conditions, 10097 events. 4972/10097 cut-off events. For 13819/13819 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 88414 event pairs, 0 based on Foata normal form. 0/8189 useless extension candidates. Maximal degree in co-relation 298626. Up to 10012 conditions per place. [2022-12-13 08:44:52,937 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 4870 selfloop transitions, 1507 changer transitions 11/6388 dead transitions. [2022-12-13 08:44:52,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 6388 transitions, 474100 flow [2022-12-13 08:44:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:44:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 08:44:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 175 transitions. [2022-12-13 08:44:52,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-13 08:44:52,939 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 603 predicate places. [2022-12-13 08:44:52,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 624 places, 6388 transitions, 474100 flow [2022-12-13 08:44:53,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 624 places, 6377 transitions, 473286 flow [2022-12-13 08:44:53,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:44:53,474 INFO L89 Accepts]: Start accepts. Operand has 624 places, 6377 transitions, 473286 flow [2022-12-13 08:44:53,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:44:53,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:44:53,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 624 places, 6377 transitions, 473286 flow [2022-12-13 08:44:53,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 624 places, 6377 transitions, 473286 flow [2022-12-13 08:44:53,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:44:53,970 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:44:53,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-13 08:44:53,971 INFO L495 AbstractCegarLoop]: Abstraction has has 624 places, 6377 transitions, 473286 flow [2022-12-13 08:44:53,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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-13 08:44:53,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:44:53,971 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:44:53,979 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-13 08:44:54,177 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-13 08:44:54,177 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:44:54,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:44:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash -237114504, now seen corresponding path program 23 times [2022-12-13 08:44:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:44:54,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324779638] [2022-12-13 08:44:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:44:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:44:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:44:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:44:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324779638] [2022-12-13 08:44:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324779638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:44:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140997451] [2022-12-13 08:44:54,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:44:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:44:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:44:54,323 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:44:54,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 08:44:54,469 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 08:44:54,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:44:54,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 08:44:54,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:44:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:44:54,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:44:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:44:54,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140997451] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:44:54,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:44:54,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2022-12-13 08:44:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419504803] [2022-12-13 08:44:54,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:44:54,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:44:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:44:54,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:44:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:44:54,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:44:54,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 6377 transitions, 473286 flow. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:44:54,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:44:54,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:44:54,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:45:39,026 INFO L130 PetriNetUnfolder]: 5043/10224 cut-off events. [2022-12-13 08:45:39,026 INFO L131 PetriNetUnfolder]: For 13857/13857 co-relation queries the response was YES. [2022-12-13 08:45:39,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388054 conditions, 10224 events. 5043/10224 cut-off events. For 13857/13857 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 89651 event pairs, 0 based on Foata normal form. 0/8326 useless extension candidates. Maximal degree in co-relation 312413. Up to 10139 conditions per place. [2022-12-13 08:45:39,131 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 5832 selfloop transitions, 630 changer transitions 0/6462 dead transitions. [2022-12-13 08:45:39,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:45:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 08:45:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-12-13 08:45:39,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33611111111111114 [2022-12-13 08:45:39,133 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 622 predicate places. [2022-12-13 08:45:39,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:39,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:39,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:45:39,562 INFO L89 Accepts]: Start accepts. Operand has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:39,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:45:39,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:45:39,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:40,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:40,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:45:40,185 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:45:40,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-13 08:45:40,186 INFO L495 AbstractCegarLoop]: Abstraction has has 643 places, 6462 transitions, 492539 flow [2022-12-13 08:45:40,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:45:40,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:45:40,186 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:45:40,192 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-13 08:45:40,392 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-13 08:45:40,392 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:45:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:45:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1428163960, now seen corresponding path program 24 times [2022-12-13 08:45:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:45:40,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621672493] [2022-12-13 08:45:40,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:45:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:45:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:45:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:45:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:45:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621672493] [2022-12-13 08:45:40,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621672493] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:45:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362862632] [2022-12-13 08:45:40,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:45:40,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:45:40,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:45:40,520 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:45:40,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 08:45:40,647 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 08:45:40,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:45:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:45:40,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:45:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:45:40,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:45:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:45:40,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362862632] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:45:40,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:45:40,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-13 08:45:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965634683] [2022-12-13 08:45:40,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:45:40,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:45:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:45:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:45:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:45:40,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:45:40,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 6462 transitions, 492539 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:45:40,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:45:40,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:45:40,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:46:31,934 INFO L130 PetriNetUnfolder]: 5321/10822 cut-off events. [2022-12-13 08:46:31,935 INFO L131 PetriNetUnfolder]: For 13918/13918 co-relation queries the response was YES. [2022-12-13 08:46:31,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421665 conditions, 10822 events. 5321/10822 cut-off events. For 13918/13918 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 96091 event pairs, 0 based on Foata normal form. 24/8830 useless extension candidates. Maximal degree in co-relation 340256. Up to 10737 conditions per place. [2022-12-13 08:46:32,046 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 5891 selfloop transitions, 903 changer transitions 24/6818 dead transitions. [2022-12-13 08:46:32,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 6818 transitions, 533423 flow [2022-12-13 08:46:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 08:46:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 08:46:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 130 transitions. [2022-12-13 08:46:32,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3140096618357488 [2022-12-13 08:46:32,047 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 643 predicate places. [2022-12-13 08:46:32,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 664 places, 6818 transitions, 533423 flow [2022-12-13 08:46:32,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 664 places, 6794 transitions, 531533 flow [2022-12-13 08:46:32,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:46:32,570 INFO L89 Accepts]: Start accepts. Operand has 664 places, 6794 transitions, 531533 flow [2022-12-13 08:46:32,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:46:32,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:46:32,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 664 places, 6794 transitions, 531533 flow [2022-12-13 08:46:33,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 664 places, 6794 transitions, 531533 flow [2022-12-13 08:46:33,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:46:33,141 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:46:33,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-13 08:46:33,142 INFO L495 AbstractCegarLoop]: Abstraction has has 664 places, 6794 transitions, 531533 flow [2022-12-13 08:46:33,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:46:33,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:46:33,142 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:46:33,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 08:46:33,351 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-13 08:46:33,351 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:46:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:46:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -282919830, now seen corresponding path program 25 times [2022-12-13 08:46:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:46:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828424398] [2022-12-13 08:46:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:46:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:46:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:46:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:46:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:46:33,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828424398] [2022-12-13 08:46:33,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828424398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:46:33,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935854175] [2022-12-13 08:46:33,489 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:46:33,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:46:33,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:46:33,492 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:46:33,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 08:46:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:46:33,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:46:33,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:46:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:46:33,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:46:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:46:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935854175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:46:33,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:46:33,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 08:46:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518041210] [2022-12-13 08:46:33,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:46:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:46:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:46:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:46:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:46:33,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:46:33,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 6794 transitions, 531533 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-13 08:46:33,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:46:33,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:46:33,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:47:30,398 INFO L130 PetriNetUnfolder]: 5373/10904 cut-off events. [2022-12-13 08:47:30,399 INFO L131 PetriNetUnfolder]: For 14631/14631 co-relation queries the response was YES. [2022-12-13 08:47:30,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435773 conditions, 10904 events. 5373/10904 cut-off events. For 14631/14631 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 96697 event pairs, 0 based on Foata normal form. 0/8888 useless extension candidates. Maximal degree in co-relation 351947. Up to 10819 conditions per place. [2022-12-13 08:47:30,573 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 6063 selfloop transitions, 809 changer transitions 0/6872 dead transitions. [2022-12-13 08:47:30,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 08:47:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 08:47:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 134 transitions. [2022-12-13 08:47:30,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2022-12-13 08:47:30,575 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 665 predicate places. [2022-12-13 08:47:30,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:30,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:31,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:47:31,095 INFO L89 Accepts]: Start accepts. Operand has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:31,238 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:47:31,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:47:31,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:31,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:31,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:47:31,588 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:47:31,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 494 [2022-12-13 08:47:31,589 INFO L495 AbstractCegarLoop]: Abstraction has has 686 places, 6872 transitions, 551394 flow [2022-12-13 08:47:31,589 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-13 08:47:31,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:47:31,589 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:47:31,596 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-13 08:47:31,789 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-13 08:47:31,790 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:47:31,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:47:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash 934647420, now seen corresponding path program 26 times [2022-12-13 08:47:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:47:31,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704173495] [2022-12-13 08:47:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:47:31,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:47:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:47:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:47:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:47:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704173495] [2022-12-13 08:47:32,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704173495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:47:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298599111] [2022-12-13 08:47:32,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:47:32,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:47:32,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:47:32,014 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:47:32,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 08:47:32,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:47:32,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:47:32,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:47:32,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:47:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:47:32,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:47:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:47:32,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298599111] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:47:32,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:47:32,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-13 08:47:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509548616] [2022-12-13 08:47:32,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:47:32,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:47:32,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:47:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:47:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:47:32,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:47:32,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 6872 transitions, 551394 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:47:32,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:47:32,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:47:32,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:48:27,840 INFO L130 PetriNetUnfolder]: 5423/11012 cut-off events. [2022-12-13 08:48:27,840 INFO L131 PetriNetUnfolder]: For 14664/14664 co-relation queries the response was YES. [2022-12-13 08:48:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451117 conditions, 11012 events. 5423/11012 cut-off events. For 14664/14664 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 97941 event pairs, 0 based on Foata normal form. 12/8984 useless extension candidates. Maximal degree in co-relation 365513. Up to 10927 conditions per place. [2022-12-13 08:48:27,998 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 6274 selfloop transitions, 697 changer transitions 39/7010 dead transitions. [2022-12-13 08:48:27,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 7010 transitions, 576459 flow [2022-12-13 08:48:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:48:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 08:48:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 99 transitions. [2022-12-13 08:48:27,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 08:48:28,000 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 685 predicate places. [2022-12-13 08:48:28,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 706 places, 7010 transitions, 576459 flow [2022-12-13 08:48:28,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 700 places, 6971 transitions, 573261 flow [2022-12-13 08:48:28,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:48:28,535 INFO L89 Accepts]: Start accepts. Operand has 700 places, 6971 transitions, 573261 flow [2022-12-13 08:48:28,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:48:28,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:48:28,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 700 places, 6971 transitions, 573261 flow [2022-12-13 08:48:29,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 700 places, 6971 transitions, 573261 flow [2022-12-13 08:48:29,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:48:29,040 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:48:29,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-13 08:48:29,041 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 6971 transitions, 573261 flow [2022-12-13 08:48:29,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:48:29,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:48:29,041 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:48:29,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 08:48:29,247 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-13 08:48:29,247 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:48:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:48:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -225570884, now seen corresponding path program 27 times [2022-12-13 08:48:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:48:29,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17044975] [2022-12-13 08:48:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:48:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:48:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:48:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:48:29,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:48:29,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17044975] [2022-12-13 08:48:29,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17044975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:48:29,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332407495] [2022-12-13 08:48:29,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:48:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:48:29,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:48:29,484 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:48:29,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 08:48:29,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 08:48:29,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:48:29,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:48:29,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:48:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:48:29,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:48:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:48:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332407495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:48:29,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:48:29,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-13 08:48:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745001778] [2022-12-13 08:48:29,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:48:29,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:48:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:48:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:48:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:48:29,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:48:29,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 6971 transitions, 573261 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:48:29,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:48:29,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:48:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:49:26,493 INFO L130 PetriNetUnfolder]: 5552/11211 cut-off events. [2022-12-13 08:49:26,493 INFO L131 PetriNetUnfolder]: For 14687/14687 co-relation queries the response was YES. [2022-12-13 08:49:26,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470513 conditions, 11211 events. 5552/11211 cut-off events. For 14687/14687 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 99636 event pairs, 0 based on Foata normal form. 0/9167 useless extension candidates. Maximal degree in co-relation 384069. Up to 11126 conditions per place. [2022-12-13 08:49:26,618 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 6837 selfloop transitions, 292 changer transitions 0/7129 dead transitions. [2022-12-13 08:49:26,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 08:49:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 08:49:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 152 transitions. [2022-12-13 08:49:26,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3247863247863248 [2022-12-13 08:49:26,620 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 704 predicate places. [2022-12-13 08:49:26,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:26,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:27,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:49:27,137 INFO L89 Accepts]: Start accepts. Operand has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:27,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:49:27,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:49:27,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:27,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:27,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:49:27,699 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:49:27,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 564 [2022-12-13 08:49:27,700 INFO L495 AbstractCegarLoop]: Abstraction has has 725 places, 7129 transitions, 600550 flow [2022-12-13 08:49:27,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:49:27,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:49:27,700 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:49:27,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 08:49:27,903 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-13 08:49:27,903 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:49:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:49:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash -566132360, now seen corresponding path program 28 times [2022-12-13 08:49:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:49:27,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049973444] [2022-12-13 08:49:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:49:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:49:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:49:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:49:28,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049973444] [2022-12-13 08:49:28,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049973444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:49:28,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770818189] [2022-12-13 08:49:28,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:49:28,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:49:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:49:28,028 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:49:28,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 08:49:28,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:49:28,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:49:28,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:49:28,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:49:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:49:28,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:49:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:49:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770818189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:49:28,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:49:28,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-13 08:49:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694252721] [2022-12-13 08:49:28,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:49:28,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:49:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:49:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:49:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:49:28,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:49:28,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 7129 transitions, 600550 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:49:28,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:49:28,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:49:28,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:50:29,072 INFO L130 PetriNetUnfolder]: 5806/11657 cut-off events. [2022-12-13 08:50:29,073 INFO L131 PetriNetUnfolder]: For 14758/14758 co-relation queries the response was YES. [2022-12-13 08:50:29,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500936 conditions, 11657 events. 5806/11657 cut-off events. For 14758/14758 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 103619 event pairs, 0 based on Foata normal form. 26/9523 useless extension candidates. Maximal degree in co-relation 410313. Up to 11572 conditions per place. [2022-12-13 08:50:29,202 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 6547 selfloop transitions, 796 changer transitions 28/7371 dead transitions. [2022-12-13 08:50:29,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 7371 transitions, 635719 flow [2022-12-13 08:50:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 08:50:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 08:50:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 121 transitions. [2022-12-13 08:50:29,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2688888888888889 [2022-12-13 08:50:29,204 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 728 predicate places. [2022-12-13 08:50:29,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 749 places, 7371 transitions, 635719 flow [2022-12-13 08:50:29,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 746 places, 7343 transitions, 633311 flow [2022-12-13 08:50:29,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:50:29,823 INFO L89 Accepts]: Start accepts. Operand has 746 places, 7343 transitions, 633311 flow [2022-12-13 08:50:30,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:50:30,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:50:30,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 746 places, 7343 transitions, 633311 flow [2022-12-13 08:50:30,484 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 746 places, 7343 transitions, 633311 flow [2022-12-13 08:50:30,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:50:30,493 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:50:30,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 670 [2022-12-13 08:50:30,493 INFO L495 AbstractCegarLoop]: Abstraction has has 746 places, 7343 transitions, 633311 flow [2022-12-13 08:50:30,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:50:30,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:50:30,494 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:50:30,499 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-13 08:50:30,694 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-13 08:50:30,694 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:50:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:50:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 731554902, now seen corresponding path program 29 times [2022-12-13 08:50:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:50:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142247578] [2022-12-13 08:50:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:50:30,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:50:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:50:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:50:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:50:30,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142247578] [2022-12-13 08:50:30,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142247578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:50:30,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298623070] [2022-12-13 08:50:30,850 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:50:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:50:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:50:30,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:50:30,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 08:50:31,001 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 08:50:31,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:50:31,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:50:31,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:50:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:50:31,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:50:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:50:31,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298623070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:50:31,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:50:31,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-13 08:50:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276905785] [2022-12-13 08:50:31,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:50:31,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:50:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:50:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:50:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:50:31,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:50:31,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 7343 transitions, 633311 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-13 08:50:31,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:50:31,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:50:31,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:51:38,374 INFO L130 PetriNetUnfolder]: 5884/11787 cut-off events. [2022-12-13 08:51:38,374 INFO L131 PetriNetUnfolder]: For 14775/14775 co-relation queries the response was YES. [2022-12-13 08:51:38,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518328 conditions, 11787 events. 5884/11787 cut-off events. For 14775/14775 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 104726 event pairs, 0 based on Foata normal form. 0/9641 useless extension candidates. Maximal degree in co-relation 426425. Up to 11702 conditions per place. [2022-12-13 08:51:38,503 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 6405 selfloop transitions, 1041 changer transitions 0/7446 dead transitions. [2022-12-13 08:51:38,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 08:51:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 08:51:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 172 transitions. [2022-12-13 08:51:38,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32950191570881227 [2022-12-13 08:51:38,504 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 753 predicate places. [2022-12-13 08:51:38,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:38,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:39,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:51:39,154 INFO L89 Accepts]: Start accepts. Operand has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:39,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:51:39,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:51:39,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:39,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:39,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:51:39,718 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:51:39,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 564 [2022-12-13 08:51:39,718 INFO L495 AbstractCegarLoop]: Abstraction has has 774 places, 7446 transitions, 657103 flow [2022-12-13 08:51:39,718 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-13 08:51:39,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:51:39,718 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:51:39,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 08:51:39,919 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-13 08:51:39,919 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:51:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1466891552, now seen corresponding path program 30 times [2022-12-13 08:51:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371519397] [2022-12-13 08:51:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:39,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:51:40,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:40,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371519397] [2022-12-13 08:51:40,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371519397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:51:40,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563566025] [2022-12-13 08:51:40,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:51:40,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:51:40,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:51:40,050 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:51:40,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 08:51:40,195 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:51:40,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:51:40,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:51:40,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:51:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:51:40,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:51:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:51:40,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563566025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:51:40,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:51:40,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-13 08:51:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853210944] [2022-12-13 08:51:40,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:51:40,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 08:51:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 08:51:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-13 08:51:40,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:51:40,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 7446 transitions, 657103 flow. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:51:40,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:51:40,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:51:40,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:52:52,482 INFO L130 PetriNetUnfolder]: 6035/12044 cut-off events. [2022-12-13 08:52:52,482 INFO L131 PetriNetUnfolder]: For 14787/14787 co-relation queries the response was YES. [2022-12-13 08:52:52,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541697 conditions, 12044 events. 6035/12044 cut-off events. For 14787/14787 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 106997 event pairs, 0 based on Foata normal form. 0/9880 useless extension candidates. Maximal degree in co-relation 448061. Up to 11959 conditions per place. [2022-12-13 08:52:52,618 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 7331 selfloop transitions, 258 changer transitions 0/7589 dead transitions. [2022-12-13 08:52:52,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 08:52:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 08:52:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 141 transitions. [2022-12-13 08:52:52,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29012345679012347 [2022-12-13 08:52:52,620 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 779 predicate places. [2022-12-13 08:52:52,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:53,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:53,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:52:53,290 INFO L89 Accepts]: Start accepts. Operand has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:53,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:52:53,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:52:53,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:53,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:53,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:52:53,884 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:52:53,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 594 [2022-12-13 08:52:53,884 INFO L495 AbstractCegarLoop]: Abstraction has has 800 places, 7589 transitions, 684913 flow [2022-12-13 08:52:53,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:52:53,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:52:53,884 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:52:53,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 08:52:54,085 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-13 08:52:54,085 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:52:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 336855156, now seen corresponding path program 31 times [2022-12-13 08:52:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524949515] [2022-12-13 08:52:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:52:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:54,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524949515] [2022-12-13 08:52:54,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524949515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:52:54,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093308127] [2022-12-13 08:52:54,229 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:52:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:52:54,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:52:54,230 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:52:54,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 08:52:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:54,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:52:54,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:52:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:52:54,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:52:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:52:54,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093308127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:52:54,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:52:54,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 08:52:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193015329] [2022-12-13 08:52:54,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:52:54,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:52:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:54,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:52:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:52:54,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:52:54,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 800 places, 7589 transitions, 684913 flow. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:52:54,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:52:54,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:52:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:54:06,618 INFO L130 PetriNetUnfolder]: 5976/11921 cut-off events. [2022-12-13 08:54:06,619 INFO L131 PetriNetUnfolder]: For 14801/14801 co-relation queries the response was YES. [2022-12-13 08:54:06,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548071 conditions, 11921 events. 5976/11921 cut-off events. For 14801/14801 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 106113 event pairs, 0 based on Foata normal form. 0/9851 useless extension candidates. Maximal degree in co-relation 456872. Up to 11836 conditions per place. [2022-12-13 08:54:06,784 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 6586 selfloop transitions, 917 changer transitions 0/7503 dead transitions. [2022-12-13 08:54:06,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 08:54:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 08:54:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 128 transitions. [2022-12-13 08:54:06,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-13 08:54:06,785 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 801 predicate places. [2022-12-13 08:54:06,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:07,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:07,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:54:07,435 INFO L89 Accepts]: Start accepts. Operand has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:07,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:54:07,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:54:07,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:08,061 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:08,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:54:08,069 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:54:08,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 635 [2022-12-13 08:54:08,070 INFO L495 AbstractCegarLoop]: Abstraction has has 822 places, 7503 transitions, 692140 flow [2022-12-13 08:54:08,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:54:08,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:54:08,070 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:54:08,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-13 08:54:08,274 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-13 08:54:08,274 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:54:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:54:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1497353218, now seen corresponding path program 32 times [2022-12-13 08:54:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:54:08,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676921188] [2022-12-13 08:54:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:54:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:54:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:54:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:54:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:54:08,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676921188] [2022-12-13 08:54:08,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676921188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:54:08,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364463954] [2022-12-13 08:54:08,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:54:08,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:54:08,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:54:08,404 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:54:08,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 08:54:08,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:54:08,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:54:08,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 08:54:08,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:54:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:54:08,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:54:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:54:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364463954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:54:08,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:54:08,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-13 08:54:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795176814] [2022-12-13 08:54:08,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:54:08,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:54:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:54:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:54:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:54:08,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 08:54:08,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 7503 transitions, 692140 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:54:08,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:54:08,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 08:54:08,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:54:13,119 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:54:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 08:54:13,134 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 08:54:13,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-13 08:54:13,150 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:54:13,334 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-13 08:54:13,335 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 0/18 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 18657 conditions, 415 events (204/414 cut-off events. For 10514/10514 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 2519 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 10320. Up to 348 conditions per place.). [2022-12-13 08:54:13,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 08:54:13,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 08:54:13,336 INFO L445 BasicCegarLoop]: Path program histogram: [32, 4, 3, 2, 1, 1, 1, 1, 1] [2022-12-13 08:54:13,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:54:13,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:54:13,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:54:13 BasicIcfg [2022-12-13 08:54:13,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:54:13,343 INFO L158 Benchmark]: Toolchain (without parser) took 826520.04ms. Allocated memory was 185.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 144.3MB in the beginning and 787.3MB in the end (delta: -643.0MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 08:54:13,344 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 161.8MB in the beginning and 161.7MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:54:13,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.88ms. Allocated memory is still 185.6MB. Free memory was 144.3MB in the beginning and 132.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 08:54:13,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.01ms. Allocated memory is still 185.6MB. Free memory was 132.8MB in the beginning and 131.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:54:13,344 INFO L158 Benchmark]: Boogie Preprocessor took 42.34ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 129.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:54:13,345 INFO L158 Benchmark]: RCFGBuilder took 491.13ms. Allocated memory is still 185.6MB. Free memory was 129.6MB in the beginning and 112.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 08:54:13,345 INFO L158 Benchmark]: TraceAbstraction took 825659.72ms. Allocated memory was 185.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 111.8MB in the beginning and 787.3MB in the end (delta: -675.5MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 08:54:13,346 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.11ms. Allocated memory is still 185.6MB. Free memory was 161.8MB in the beginning and 161.7MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.88ms. Allocated memory is still 185.6MB. Free memory was 144.3MB in the beginning and 132.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.01ms. Allocated memory is still 185.6MB. Free memory was 132.8MB in the beginning and 131.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.34ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 129.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 491.13ms. Allocated memory is still 185.6MB. Free memory was 129.6MB in the beginning and 112.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 825659.72ms. Allocated memory was 185.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 111.8MB in the beginning and 787.3MB in the end (delta: -675.5MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 22 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, 24 PlacesBefore, 24 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 38 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, 27 PlacesBefore, 27 PlacesAfterwards, 44 TransitionsBefore, 44 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, 51 TransitionsBefore, 51 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, 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, 36 PlacesBefore, 36 PlacesAfterwards, 67 TransitionsBefore, 67 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, 82 TransitionsBefore, 82 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, 44 PlacesBefore, 44 PlacesAfterwards, 79 TransitionsBefore, 79 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, 47 PlacesBefore, 47 PlacesAfterwards, 72 TransitionsBefore, 72 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: 2.4s, 57 PlacesBefore, 54 PlacesAfterwards, 93 TransitionsBefore, 90 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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, 55 PlacesBefore, 55 PlacesAfterwards, 87 TransitionsBefore, 87 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: 2.1s, 66 PlacesBefore, 65 PlacesAfterwards, 157 TransitionsBefore, 156 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, 73 PlacesBefore, 73 PlacesAfterwards, 238 TransitionsBefore, 238 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, 81 PlacesBefore, 81 PlacesAfterwards, 290 TransitionsBefore, 290 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, 89 PlacesBefore, 89 PlacesAfterwards, 325 TransitionsBefore, 325 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, 97 PlacesBefore, 97 PlacesAfterwards, 368 TransitionsBefore, 368 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, 105 PlacesBefore, 105 PlacesAfterwards, 430 TransitionsBefore, 430 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, 112 PlacesBefore, 112 PlacesAfterwards, 545 TransitionsBefore, 545 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, 122 PlacesBefore, 122 PlacesAfterwards, 640 TransitionsBefore, 640 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, 142 PlacesBefore, 142 PlacesAfterwards, 1102 TransitionsBefore, 1102 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, 150 PlacesBefore, 150 PlacesAfterwards, 1112 TransitionsBefore, 1112 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, 168 PlacesBefore, 168 PlacesAfterwards, 1310 TransitionsBefore, 1310 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, 182 PlacesBefore, 182 PlacesAfterwards, 1231 TransitionsBefore, 1231 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, 1330 TransitionsBefore, 1330 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, 248 PlacesBefore, 248 PlacesAfterwards, 1538 TransitionsBefore, 1538 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, 1642 TransitionsBefore, 1642 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, 311 PlacesBefore, 311 PlacesAfterwards, 1657 TransitionsBefore, 1657 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, 369 PlacesBefore, 369 PlacesAfterwards, 2284 TransitionsBefore, 2284 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, 414 PlacesBefore, 414 PlacesAfterwards, 2557 TransitionsBefore, 2557 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, 449 PlacesBefore, 449 PlacesAfterwards, 2956 TransitionsBefore, 2956 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, 474 PlacesBefore, 474 PlacesAfterwards, 3218 TransitionsBefore, 3218 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, 487 PlacesBefore, 487 PlacesAfterwards, 4600 TransitionsBefore, 4600 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, 516 PlacesBefore, 516 PlacesAfterwards, 5008 TransitionsBefore, 5008 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, 548 PlacesBefore, 548 PlacesAfterwards, 6059 TransitionsBefore, 6059 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, 590 PlacesBefore, 590 PlacesAfterwards, 6176 TransitionsBefore, 6176 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, 624 PlacesBefore, 624 PlacesAfterwards, 6377 TransitionsBefore, 6377 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, 643 PlacesBefore, 643 PlacesAfterwards, 6462 TransitionsBefore, 6462 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, 664 PlacesBefore, 664 PlacesAfterwards, 6794 TransitionsBefore, 6794 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, 686 PlacesBefore, 686 PlacesAfterwards, 6872 TransitionsBefore, 6872 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, 700 PlacesBefore, 700 PlacesAfterwards, 6971 TransitionsBefore, 6971 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, 725 PlacesBefore, 725 PlacesAfterwards, 7129 TransitionsBefore, 7129 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, 746 PlacesBefore, 746 PlacesAfterwards, 7343 TransitionsBefore, 7343 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, 774 PlacesBefore, 774 PlacesAfterwards, 7446 TransitionsBefore, 7446 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, 800 PlacesBefore, 800 PlacesAfterwards, 7589 TransitionsBefore, 7589 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, 822 PlacesBefore, 822 PlacesAfterwards, 7503 TransitionsBefore, 7503 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: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 0/18 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 18657 conditions, 415 events (204/414 cut-off events. For 10514/10514 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 2519 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 10320. Up to 348 conditions per place.). - TimeoutResultAtElement [Line: 83]: 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 (18states, 0/18 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 18657 conditions, 415 events (204/414 cut-off events. For 10514/10514 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 2519 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 10320. Up to 348 conditions per place.). - TimeoutResultAtElement [Line: 82]: 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 (18states, 0/18 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 18657 conditions, 415 events (204/414 cut-off events. For 10514/10514 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 2519 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 10320. Up to 348 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 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: 825.5s, OverallIterations: 46, TraceHistogramMax: 4, PathProgramHistogramMax: 32, EmptinessCheckTime: 0.0s, AutomataDifference: 765.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 4390 SdHoareTripleChecker+Valid, 22.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4390 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 324 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 1059 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20336 IncrementalHoareTripleChecker+Invalid, 21740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1059 mSolverCounterUnsat, 152 mSDtfsCounter, 20336 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2801 GetRequests, 1575 SyntacticMatches, 46 SemanticMatches, 1180 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 10969 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=692140occurred in iteration=45, InterpolantAutomatonStates: 910, 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.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 2004 ConstructedInterpolants, 28 QuantifiedInterpolants, 16824 SizeOfPredicates, 205 NumberOfNonLiveVariables, 7809 ConjunctsInSsa, 624 ConjunctsInUnsatCore, 127 InterpolantComputations, 7 PerfectInterpolantSequences, 167/779 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